Spectral radius, edge-disjoint cycles and cycles of the same length

2021/08/20 by Lin, Huiqiu, Zhai, Mingqing, Zhao, Yanhua · 4 citations
#05C35 #05C50 #Combinatorics (math.CO) #FOS: Mathematics #G.2

paper · doi:10.48550/arxiv.2108.09057

Abstract

In this paper, we give spectral conditions to guarantee the existence of two edge disjoint cycles and two cycles of the same length. These two results can be seen as spectral analogues of Erdős and Posa's size condition and Erdős' classic problem on non existence of two cycles of the same length. By using double leading eigenvectors skill, we further give spectral condition to guarantee the existence of k edge disjoint triangles.

Cited by

• Spectral supersaturation for color-critical graphs
• Turán number of books in non-bipartite graphs
• The spectral Turán problem: Characterizing spectral-consistent graphs
• Spectral extrema of graphs forbidding a fan

Related

• Spectral radius and Hamiltonian properties of graphs, II
• Counting substructures and eigenvalues II: quadrilaterals
• Extremal problems on planar graphs without k edge-disjoint cycles
• The high order spectral radius of graphs without long cycles or paths
• More on Nosal's spectral theorem: Books and 4-cycles