
arXiv: 2108.09057
In this paper, we provide spectral conditions for the existence of two edge-disjoint cycles and two cycles of the same length in a graph, which can be viewed as the spectral analogues of Erdős and Posa's condition and Erdős' classic problem about the maximum number of edges of a graph without two edge-disjoint cycles and two cycles of the same length, respectively. Furthermore, we give a spectral condition to guarantee the existence of $k$ edge-disjoint triangles in a graph.
Extremal problems in graph theory, Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), G.2, edge-disjoint cycles, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), spectral radius of a graph, Paths and cycles, 05C50, 05C35
Extremal problems in graph theory, Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), G.2, edge-disjoint cycles, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), spectral radius of a graph, Paths and cycles, 05C50, 05C35
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
