On generalized Tur\'an problems with bounded matching number

TL;DR

This paper extends the study of generalized Turán problems by analyzing the maximum number of copies of an arbitrary graph H in large graphs that exclude certain subgraphs, specifically focusing on cases involving bounded matching numbers.

Contribution

It generalizes previous results by considering arbitrary graphs H and extends the understanding of Turán numbers with bounded matching constraints.

Findings

Derived bounds for generalized Turán numbers with bounded matching number

Extended previous results to arbitrary graphs H

Provided new insights into extremal graph configurations

Abstract

Given a graph $H$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number $\mathrm{ex}(n,H,\mathcal{F})$ is the maximum number of copies of $H$ in an $n$-vertex graphs that do not contain any member of $\mathcal{F}$ as a subgraph. Recently there has been interest in studying the case $\mathcal{F}=\{F,M_{s+1}\}$ for arbitrary $F$ and $H=K_r$. We extend these investigations to the case $H$ is arbitrary as well.