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

DOI10.1016/j.ejc.2023.103793zbMath1522.05220arXiv2207.10162OpenAlexW4386364138MaRDI QIDQ6056558

Dániel Gerbner, Xiutao Zhu, Hilal Hama Karim, Yaojun Chen, Ervin Gyoeri

Publication date: 2 October 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(H\)-free graphgeneralized Turán number

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items

Generalized Turán numbers for the edge blow-up of a graph ⋮ Some exact results for non-degenerate generalized Turán problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On unavoidable graphs
• On the maximum number of five-cycles in a triangle-free graph
• Unavoidable stars in 3-graphs
• Pentagons vs. triangles
• The maximum number of edges in a 3-graph not containing a given star
• The maximum number of cliques in graphs without long cycles
• Extremal graphs for intersecting triangles
• On the number of pentagons in triangle-free graphs
• Some sharp results on the generalized Turán numbers
• Generalized Turán number for linear forests
• A note on the uniformity threshold for Berge hypergraphs
• Generalized Turán problems for even cycles
• Counting copies of a fixed subgraph in \(F\)-free graphs
• The maximum number of triangles in a graph of given maximum degree
• On the structure of linear graphs
• Many \(T\) copies in \(H\)-free graphs
• Stability version of Dirac's theorem and its applications for generalized Turán problems