Spectral Turán problems for intersecting even cycles

From MaRDI portal




Abstract: Let C2k1,2k2,ldots,2kt denote the graph obtained by intersecting t distinct even cycles C2k1,C2k2,ldots,C2kt at a unique vertex. In this paper, we determine the unique graphs with maximum adjacency spectral radius among all graphs on n vertices that do not contain any C2k1,2k2,ldots,2kt as a subgraph, for n sufficiently large. When one of the constituent even cycles is a C4, our results improve upper bounds on the Tur'an numbers for intersecting even cycles that follow from more general results of F"{u}redi [20] and Alon, Krivelevich and Sudakov [1]. Our results may be seen as extensions of previous results for spectral Tur'an problems on forbidden even cycles C2k,kge2 (see [8, 34, 44, 45]).



Cites work









This page was built for publication: Spectral Turán problems for intersecting even cycles

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