2023/09/17 by Gerbner, Dániel · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2309.09113
Given a graph H and a family of graphs F, the generalized Turán number ex(n,H,F) is the maximum number of copies of H in an n-vertex graphs that do not contain any member of F as a subgraph. Recently there has been interest in studying the case F=\F,Ms+1\ for arbitrary F and H=Kr. We extend these investigations to the case H is arbitrary as well.