2025/03/10 by Lu, Yongchun, Kang, Liying, Xue, Yisai
#05C35 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2503.07386
Let \( F \) be a family of graphs. The generalized Turán number \( ex(n, Kr, F) \) is the maximum number of Kr in an \( n \)-vertex graph that does not contain any member of \( F \) as a subgraph. Recently, Alon and Frankl initiated the study of Turán problems with bounded matching number. In this paper, we determine the generalized Turán number of \( C≥ k \) with bounded matching number.