Spectral extremal problem on $t$ copies of $\ell$-cycle
Abstract
Denote by the disjoint union of cycles of length . Let and be the maximum size and spectral radius over all -vertex -free graphs, respectively. In this paper, we shall pay attention to the study of both and . On the one hand, we determine and characterize the extremal graph for any integers and , where . This generalizes the result on of Erd\H{o}s [Arch. Math. 13 (1962) 222--227] as well as the research on of F\"{u}redi and Gunderson [Combin. Probab. Comput. 24 (2015) 641--645]. On the other hand, we focus on the spectral Tur\'{a}n-type function , and determine the extremal graph for any fixed and large enough . Our results not only extend some classic spectral extremal results on triangles, quadrilaterals and general odd cycles due to Nikiforov, but also develop the famous spectral even cycle conjecture proposed by Nikiforov (2010) and confirmed by Cioab\u{a}, Desai and Tait (2022).
Keywords
Cite
@article{arxiv.2302.03229,
title = {Spectral extremal problem on $t$ copies of $\ell$-cycle},
author = {Longfei Fang and Mingqing Zhai and Huiqiu Lin},
journal= {arXiv preprint arXiv:2302.03229},
year = {2023}
}
Comments
25 pages, one figure