paper

On a conjecture of spectral extremal problems

arXiv:2203.10831

Abstract

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

17