Extensions of the Erdős-Gallai theorem and Luo's theorem

DOI10.1017/S0963548319000269MaRDI QIDQ5222574zbMATHFDO

Authors Bo Ning, Xing Peng

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

zbMATH Keywords

Turán number of paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Abstract: The famous ErdH{o}s-Gallai Theorem on the Tur'an number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $frac2mn$ edges. In this note, we first establish a simple but novel extension of the ErdH{o}s-Gallai Theorem by proving that every graph $G$ contains a path with at least $frac(s+1)N_{s+1}(G)N_s(G)+s-1$ edges, where $N_j(G)$ denotes the number of $j$-cliques in $G$ for $1leqjleqomega(G)$. We also construct a family of graphs which shows our extension improves the estimate given by ErdH{o}s-Gallai Theorem. Among applications, we show, for example, that the main results of cite{L17}, which are on the maximum possible number of $s$-cliques in an $n$-vertex graph without a path with $l$ vertices (and without cycles of length at least $c$), can be easily deduced from this extension. Indeed, to prove these results, Luo cite{L17} generalized a classical theorem of Kopylov and established a tight upper bound on the number of $s$-cliques in an $n$-vertex 2-connected graph with circumference less than $c$. We prove a similar result for an $n$-vertex 2-connected graph with circumference less than $c$ and large minimum degree. We conclude this paper with an application of our results to a problem from spectral extremal graph theory on consecutive lengths of cycles in graphs.

Recommendations

• The maximum number of cliques in graphs without long cycles
• Stability in the Erdős-Gallai theorems on cycles and paths
• Hypergraph extensions of the Erdős-Gallai theorem
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• Hypergraph extensions of the Erdős-Gallai theorem

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• A note on the maximum number of triangles in a C₅‐free graph
• A spectral condition for odd cycles in graphs
• Cycles in 2-connected graphs
• Cycles in weighted graphs
• Large cycles in graphs
• Long cycles and the codiameter of a graph. I
• Long cycles in subgraphs with prescribed minimum degree
• Many \(T\) copies in \(H\)-free graphs
• Maximal circuits of graphs. I
• On maximal circuits in directed graphs
• On maximal paths and circuits of 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
• On the number of pentagons in triangle-free graphs
• Path Ramsey numbers in multicolorings
• Pentagons vs. triangles
• Sufficient Conditions for Circuits in Graphs^†
• The history of degenerate (bipartite) extremal graph problems

Cited in

(30)

• Eigenvalues and cycles of consecutive lengths
• Stability in the Erdős-Gallai theorems on cycles and paths
• A spectral condition for the existence of a pentagon in non-bipartite graphs
• The maximum number of cliques in graphs with bounded odd circumference
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Spectral extrema of graphs: forbidden hexagon
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• extremal aspects of the Erdős-Gallai-Tuza conjecture
• The maximum number of cliques in graphs with prescribed order, circumference and minimum degree
• Maximizing the number of cliques in graphs with given matching number
• Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
• 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
• Revisit of Erdős-Gallai's theorem on the circumference of a graph
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number
• Exact results on generalized Erdős-Gallai problems
• Generalized Turán number of even linear forests
• Further results on the generalized Turán number of spanning linear forests
• Generalized Turán number for linear forests
• A spectral condition for odd cycles in non-bipartite graphs
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
• Erdős-Gallai stability theorem for linear forests
• The generalized Turán number of spanning linear forests
• Stability of Woodall's theorem and spectral conditions for large cycles
• Hypergraph extensions of the Erdős-Gallai theorem
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• Spectral radius, edge-disjoint cycles and cycles of the same length
• The spectral radius, maximum average degree and cycles of consecutive lengths of graphs
• A localized approach for Turán number of long cycles
• Ordering \(Q\)-indices of graphs: given size and circumference

This page was built for publication: Extensions of the Erdős-Gallai theorem and Luo's theorem

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