On Turán-good graphs

DOI10.1016/j.disc.2021.112445zbMath1466.05103arXiv2012.12646OpenAlexW3158359119MaRDI QIDQ2032868

Dániel Gerbner

Publication date: 14 June 2021

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

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

zbMATH Keywords

Turán graphextremal graph theorygeneralized Turán problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Generalized Turán problems for double stars, Generalized Turán results for intersecting cliques, The cycle of length four is strictly \(F\)-Turán-good, Some exact results for non-degenerate generalized Turán problems, Subgraph densities in \(K_r\)-free graphs, Some exact results of the generalized Turán numbers for paths, Some results on \(k\)-Turán-good graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• Pentagons vs. triangles
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On the number of pentagons in triangle-free graphs
• Some sharp results on the generalized Turán numbers
• Generalized Turán problems for even cycles
• Counting copies of a fixed subgraph in \(F\)-free graphs
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• A generalized Turán problem and its applications
• Many \(T\) copies in \(H\)-free graphs