2022/10/03 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.2210.00666
openalex publication_date 2022/10/03 · openalex created_date 2022/10/06 · openalex updated_date 2026/07/28
Given two graphs H and F, the generalized Turán number ex(n,H,F) is the largest number of copies of H in an n-vertex F-free graph. For every F and sufficiently large n, we present an extremal graph for a generalized Turán problem, i.e., an F-free n vertex graph G that for some H contains exactly ex(n,H,F) copies of H.