2000 character limit reached
On generalized Turán problems with bounded matching number (2410.12338v1)
Published 16 Oct 2024 in math.CO
Abstract: The generalized Tur\'an number $\mathrm{ex}(n, H, \mathcal{F})$ is defined as the maximum number of copies of a graph $H$ in an $n$-vertex graph that does not contain any graph $F \in \mathcal{F}$. Alon and Frankl initiated the study of Tur\'an problems with a bounded matching number.In this paper, we establish stability results for generalized Tur\'an problems with bounded matching number.Using the stability results, we provide exact values of $\ex(n,K_r,{F,M_{s+1}})$ for $F$ being any non-bipartite graph or a path on $k$ vertices.