On a conjecture of spectral extremal problems
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\'an graph is the complete -partite graph on 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 be any graph such that the graphs in are Tur\'{a}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\u{a}, Desai and Tait's conjecture is completely solved.
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