A complete solution to the Boots-Royle/Cao-Vince conjecture
math.CO
Submitted: 2026-07-21
Updated: 2026-10-26
Comments: 18 pages, 2 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Boots and Royle, and independently Cao and Vince, conjectured that the join of an edge and a path on n-2 vertices is the unique planar graph of maximum adjacency spectral radius for n at least 9.
Terminology
Abstract
Boots and Royle, and independently Cao and Vince, conjectured that the join of an edge and a path on n-2 vertices is the unique planar graph of maximum adjacency spectral radius for n at least 9. Tait and Tobin (JCTB, 2017) proved the conjecture for sufficiently large order. In this paper, we completely resolved the Boots-Royle/Cao-Vince conjecture.
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality