paper

Spectral extremal problem on copies of -cycle

arXiv:2302.03229

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ős [Arch. Math. 13 (1962) 222--227] as well as the research on of Füredi and Gunderson [Combin. Probab. Comput. 24 (2015) 641--645]. On the other hand, we focus on the spectral Turá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ă, Desai and Tait (2022).

25 pages, one figure