Year: 2026
Type: preprint
Abstract: A graph is color-critical if it contains at least one color-critical edge. For every fixed three-chromatic color-critical graph $H$, we determine the maximum spectral radius of an $n$-vertex non-bipartite $H$-free graph and characterize the unique extremal graph for all sufficiently large $n$. The extremal graph belongs to one of three graph families: $J_n(s,t)$, $\mathrm{ST}_2(n-1)$ or $L_n(s,t)$. Explicit conditions on $H$ determine the family and its exact parameters. This paper generalizes the results for books and theta graphs to all three-chromatic color-critical graphs. Furthermore, an three-chromatic example demonstrates that spectral extremal graphs are not necessarily edge-extremal, disproving a conjecture of Fang and Lin [J. Algebraic Combin., 2026].
Source: arXiv (Cornell University)
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236834902
