WorksMathematics
Non-bipartite spectral extremal graphs forbidding a three-chromatic color-critical graph
Abstract
A graph is color-critical if it contains at least one color-critical edge. For every fixed three-chromatic color-critical graph , we determine the maximum spectral radius of an -vertex non-bipartite -free graph and characterize the unique extremal graph for all sufficiently large . The extremal graph belongs to one of three graph families: , or . Explicit conditions on 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].