Extremal Counterexamples and Structural Rigidity for Graffiti.pc Conjecture 138
Year: 2026
Type: preprint
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.
Author: Newton, Tony
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236071167
