English

On a conjecture of spectral extremal problems

Combinatorics 2022-03-22 v1

Abstract

For a simple graph FF, let Ex(n,F)\mathrm{Ex}(n, F) and Exsp(n,F)\mathrm{Ex_{sp}}(n,F) denote the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral radius in an nn-vertex graph without any copy of the graph FF, respectively. The Tur\'an graph Tn,rT_{n,r} is the complete rr-partite graph on nn vertices where its part sizes are as equal as possible. Cioab\u{a}, Desai and Tait [The spectral radius of graphs with no odd wheels, European J. Combin., 99 (2022) 103420] posed the following conjecture: Let FF be any graph such that the graphs in Ex(n,F)\mathrm{Ex}(n,F) are Tur\'{a}n graphs plus O(1)O(1) edges. Then Exsp(n,F)Ex(n,F)\mathrm{Ex_{sp}}(n,F)\subset \mathrm{Ex}(n,F) for sufficiently large nn. In this paper we consider the graph FF such that the graphs in Ex(n,F)\mathrm{Ex}(n, F) are obtained from Tn,rT_{n,r} by adding O(1)O(1) edges, and prove that if GG has the maximum spectral radius among all nn-vertex graphs not containing FF, then GG is a member of Ex(n,F)\mathrm{Ex}(n, F) for nn large enough. Then Cioab\u{a}, Desai and Tait's conjecture is completely solved.

Keywords

Cite

@article{arxiv.2203.10831,
  title  = {On a conjecture of spectral extremal problems},
  author = {Jing Wang and Liying Kang and Yusai Xue},
  journal= {arXiv preprint arXiv:2203.10831},
  year   = {2022}
}

Comments

17

R2 v1 2026-06-24T10:20:11.613Z