Stability version of Dirac's theorem and its applications for generalized Turán problems

DOI10.1112/blms.12823zbMath1521.05075arXiv2207.12465OpenAlexW4328117971WikidataQ123287419 ScholiaQ123287419MaRDI QIDQ6096834

Nika Salia, Chuanqi Xiao, Xiutao Zhu, Zequn Lv, Ervin Gyoeri, Zhen He

Publication date: 15 September 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.12465

zbMATH Keywords

generalized Turán numbers

Mathematics Subject Classification ID

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

Related Items (1)

The maximum number of triangles in \(F_k\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• On the maximum number of five-cycles in a triangle-free graph
• Stability results on the circumference of a graph
• Additive approximation of generalized Turán questions
• Pentagons vs. triangles
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• The maximum number of cliques in graphs without long cycles
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• On the number of pentagons in triangle-free graphs
• A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• On maximal paths and circuits of graphs
• A note on the maximum number of triangles in a C₅‐free graph
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• Some Theorems on Abstract Graphs
• Many \(T\) copies in \(H\)-free graphs
• On the maximum number of odd cycles in graphs without smaller odd cycles

This page was built for publication: Stability version of Dirac's theorem and its applications for generalized Turán problems