On the generalized Turán problem for odd cycles

DOI10.1137/24M1632632zbMATH Open1547.05133MaRDI QIDQ6606915FDOQ6606915

Authors: Csongor Beke, Oliver Janzer 

Publication date: 17 September 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• On the maximum number of odd cycles in graphs without smaller odd cycles
• On the maximum number of odd cycles in graphs without smaller odd cycles
• Pentagons in triangle-free graphs
• Generalized Turán problems for even cycles
• Maximizing five-cycles in \(K_r\)-free graphs

zbMATH Keywords

odd cyclesgeneralized Turán number

Mathematics Subject Classification ID

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

Cites Work

• On the number of pentagons in triangle-free graphs
• On maximal paths and circuits of graphs
• On the maximum number of five-cycles in a triangle-free graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph removal lemmas
• Pentagons vs. triangles
• On the number of \(C_ 5's\) in a triangle-free graph
• The maximum number of q-cliques in a graph with no p-clique
• The maximum number of triangles in \(C_{2k+1}\)-free graphs
• Title not available (Why is that?)
• On 3-uniform hypergraphs without a cycle of a given length
• Many \(T\) copies in \(H\)-free graphs
• Pentagons in triangle-free graphs
• On the maximum number of odd cycles in graphs without smaller odd cycles
• Generalized Turán problems for even cycles
• A generalized Turán problem and its applications

Cited In (1)

• On the maximum number of odd cycles in graphs without smaller odd cycles

This page was built for publication: On the generalized Turán problem for odd cycles

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