Extensions of the Erdős–Gallai theorem and Luo’s theorem
From MaRDI portal
Publication:5222574
DOI10.1017/S0963548319000269zbMath1436.05053arXiv1801.09981MaRDI QIDQ5222574
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.09981
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items
Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ Generalized Turán number for linear forests ⋮ Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ Ordering \(Q\)-indices of graphs: given size and circumference ⋮ Eigenvalues and cycles of consecutive lengths ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ The spectral radius, maximum average degree and cycles of consecutive lengths of graphs ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ The maximum number of cliques in hypergraphs without large matchings ⋮ A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ A spectral condition for odd cycles in non-bipartite graphs ⋮ Maximizing the number of cliques in graphs with given matching number ⋮ Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs ⋮ A spectral condition for the existence of a pentagon in non-bipartite graphs ⋮ Generalized Turán number of even linear forests ⋮ Spectral extrema of graphs: forbidden hexagon ⋮ Further results on the generalized Turán number of spanning linear forests ⋮ The generalized Turán number of spanning linear forests
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles in 2-connected graphs
- On the maximum number of five-cycles in a triangle-free graph
- On the maximum size of connected hypergraphs without a path of given length
- Long cycles and the codiameter of a graph. I
- Pentagons vs. triangles
- Cycles in weighted graphs
- Long cycles in subgraphs with prescribed minimum degree
- On maximal circuits in directed graphs
- Path Ramsey numbers in multicolorings
- On the number of pentagons in triangle-free graphs
- A spectral condition for odd cycles in graphs
- Large cycles in graphs
- On maximal paths and circuits of graphs
- Maximal circuits of graphs. I
- A note on the maximum number of triangles in a C5‐free graph
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Sufficient Conditions for Circuits in Graphs†
- Many \(T\) copies in \(H\)-free graphs
