paper

A reduction principle for non--partite spectral extremal problems, with a complete multipartite classification

arXiv:2607.00561

Abstract

A graph is non--partite if its chromatic number exceeds . For an edge-color-critical graph with , let be the maximum adjacency spectral radius among non--partite -free graphs of order , and let and be the families of such graphs attaining, respectively, this maximum spectral radius and the maximum number of edges . Fang and Lin conjectured that for every such and all large . We prove a reduction principle: if is \emph{-embeddable} and , where is the Turán graph, then the inclusion holds and, moreover, the spectral extremal graph is unique. The reduction replaces the spectral problem by an edge-counting one, and its proof rests on a direct comparison of secular functions together with a second-order residual refinement of the Rayleigh principle. We then determine the spectral extremal graphs for all edge-color-critical complete multipartite forbidden graphs. For with we show \[ \mathrm{ex}_{r+1}(n,F)=|E(T_{n,r})|-\Bigl\lfloor\frac nr\Bigr\rfloor+2(t_{\min}-1), \qquad t_{\min}:=\min\{t_3,\ldots,t_{r+1}\}, \] for all sufficiently large , and we identify the unique spectral extremal graph; in particular . The endpoint lies outside the embeddability framework and is treated by a separate argument: for with , the unique non--partite spectral extremal graph is , obtained through a saturation reduction followed by the spectral refinement of Turán's theorem. The complete graph and the complete split graph

arXiv comment40 pages