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

2022/09/07 by Dániel Gerbner, Gerbner, Dániel
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2209.03426

openalex publication_date 2022/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The generalized Turán number ex(n,H,F) is the maximum number of copies of H in n-vertex F-free graphs. We consider the case where χ(H)<χ(F). There are several exact results on ex(n,H,F) when the extremal graph is a complete (χ(F)-1)-partite graph. We obtain multiple exact results with other kinds of extremal graphs.

Related

• On the extremal graphs in generalized Turán problems
• Some stability and exact results in generalized Turán problems
• Survey of generalized Turán problems -- counting subgraphs
• Generalized Turán results for matchings
• Generalized Turán results for disjoint copies of degenerate graphs