Spectral extremal problem on t copies of \ell-cycle

Authors Longfei Fang, Mingqing Zhai, Huiqiu Lin

Publication date 6 February 2023

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: Denote by

t C_{e} l l

the disjoint union of

t

cycles of length

e l l

. Let

e x (n, F)

and

s p e x (n, F)

be the maximum size and spectral radius over all

n

-vertex

F

-free graphs, respectively. In this paper, we shall pay attention to the study of both

e x (n, t C_{e} l l)

and

s p e x (n, t C_{e} l l)

. On the one hand, we determine

e x (n, t C_{2 e l l + 1})

and characterize the extremal graph for any integers

t, e l l

and

n g e f (t, e l l)

, where

f (t, e l l) = O (t e l l^{2})

. This generalizes the result on

e x (n, t C_{3})

of ErdH{o}s [Arch. Math. 13 (1962) 222--227] as well as the research on

e x (n, C_{2 e l l + 1})

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

s p e x (n, t C_{e l l})

, and determine the extremal graph for any fixed

t, e l l

and large enough

n

. 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 Cioabu{a}, Desai and Tait (2022).

This page was built for publication: Spectral extremal problem on $t$ copies of $\ell$-cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425651)