Extremal Counterexamples and Structural Rigidity for Graffiti.pc Conjecture 138

A conjecture of Graffiti.pc relates the largest induced path to the separation of maximum-degree vertices in a graph square. We construct counterexamples at every order fromten onwards, establish sharp replacement inequalities, and give exact finite certificates forminimum-order classifications in connected graphs and trees. The minimum counterexamplesfor square-graph distance are two explicitly described six-cycle blow-ups. Earlier reportedcounterexamples are distinguished from the extremal results developed here.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24354328
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Extremal Counterexamples and Structural Rigidity for Graffiti.pc Conjecture 138

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Extremal Counterexamples and Structural Rigidity for Graffiti.pc Conjecture 138

Tony Newton
preprint en

Abstract

A conjecture of Graffiti.pc relates the largest induced path to the separation of maximum-degree vertices in a graph square. We construct counterexamples at every order fromten onwards, establish sharp replacement inequalities, and give exact finite certificates forminimum-order classifications in connected graphs and trees. The minimum counterexamplesfor square-graph distance are two explicitly described six-cycle blow-ups. Earlier reportedcounterexamples are distinguished from the extremal results developed here.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon