A localized approach for Turán number of long cycles

DOI10.1002/JGT.23191MaRDI QIDQ6667591FDOQ6667591

Authors: Kai Zhao, Xiao-Dong Zhang 

Publication date: 20 January 2025

Published in: Journal of Graph Theory (Search for Journal in Brave)

Recommendations

• Revisit of Erdős-Gallai's theorem on the circumference of a graph
• Turán‐type problems for long cycles in random and pseudo‐random graphs
• Extremal problems for cycles in graphs
• Extremal numbers of cycles revisited
• The maximum number of cliques in graphs without long cycles

zbMATH Keywords

weighted functionErdős-Gallai theoremTurán number

Mathematics Subject Classification ID

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

Cites Work

• On maximal paths and circuits of graphs
• Title not available (Why is that?)
• Long cycles and the codiameter of a graph. I
• The maximum number of cliques in graphs without long cycles
• Avoiding long Berge cycles
• Extensions of the Erdős-Gallai theorem and Luo's theorem
• Localized versions of extremal problems
• The Number of Cliques in Graphs Covered by Long Cycles
• Graphs with almost all edges in long cycles
• The codiameter of a 2-connected graph
• Avoiding long Berge cycles. II: Exact bounds for all \(n\)
• Ramsey-Turán problems with small independence numbers

This page was built for publication: A localized approach for Turán number of long cycles

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