On the maximum number of odd cycles in graphs without smaller odd cycles
From MaRDI portal
Publication:6056808
DOI10.1002/jgt.22738zbMath1522.05208arXiv1806.09953OpenAlexW2981387241WikidataQ114236148 ScholiaQ114236148MaRDI QIDQ6056808
Bartłomiej Kielak, Andrzej Grzesik
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.09953
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items
The maximum number of paths of length three in a planar graph, Stability version of Dirac's theorem and its applications for generalized Turán problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 3-uniform hypergraphs without a cycle of a given length
- On the maximum number of five-cycles in a triangle-free graph
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- Pentagons vs. triangles
- On the number of \(C_ 5's\) in a triangle-free graph
- The inducibility of graphs
- A bound on the inducibility of cycles
- Pentagons in triangle-free graphs
- What we know and what we do not know about Turán numbers
- On the number of pentagons in triangle-free graphs
- Generalized Turán problems for even cycles
- The Maximum Number of Triangles in C2k+1-Free Graphs
- Extremal problems for cycles in graphs
- A Generalized Turán Problem and its Applications
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On the structure of linear graphs
- On the inducibility of cycles
- Many \(T\) copies in \(H\)-free graphs
