Some exact results for non-degenerate generalized Turán problems

DOI10.37236/11574arXiv2209.03426MaRDI QIDQ6117259

Dániel Gerbner

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Turán graph\(F\)-Turán-good graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Extremal graphs for intersecting cliques
• Some sharp results on the generalized Turán numbers
• On Turán-good graphs
• Maximizing five-cycles in \(K_r\)-free graphs
• Paths of length three are \(K_{r+1}\)-Turán-good
• Some exact results for generalized Turán problems
• Some exact results of the generalized Turán numbers for paths
• The inducibility of complete bipartite graphs
• On Independent Complete Subgraphs in a Graph
• On the structure of linear graphs
• Many \(T\) copies in \(H\)-free graphs
• Generalized Turán problems for double stars
• Paths are Turán-good
• Generalized Turán results for intersecting cliques
• The maximum number of triangles in \(F_k\)-free graphs
• Some Stability and Exact Results in Generalized Turán Problems

This page was built for publication: Some exact results for non-degenerate generalized Turán problems