Stability of generalized Tur\'an number for linear forests

TL;DR

This paper investigates the maximum number of r-cliques in graphs that avoid certain linear forests, establishing stability results and applications to Erdős-Gallai Theorem stability for matchings.

Contribution

It provides new bounds for the maximum number of r-cliques in linear forest-free graphs with minimum degree constraints, along with stability versions and applications.

Findings

Determined the maximum number of r-cliques in L_k-free graphs with minimum degree d.

Established a stability version of the maximum clique count result.

Applied the stability result to the Erdős-Gallai Theorem on matchings.

Abstract

Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number of $\mathcal{F}$ is the maximum number of copies of $T$ in an $\mathcal{F}$-free graph on $n$ vertices, denoted by $ex(n,T,\mathcal{F})$. When $T = K_r$, $ex(n, K_r, \mathcal{F})$ is a function specifying the maximum possible number of $r$-cliques in an $\mathcal{F}$-free graph on $n$ vertices. A linear forest is a forest whose connected components are all paths and isolated vertices. Let $\mathcal{L}_{k}$ be the family of all linear forests of size $k$ without isolated vertices. In this paper, we obtained the maximum possible number of $r$-cliques in $G$, where $G$ is $\mathcal{L}_{k}$-free with minimum degree at least $d$. Furthermore, we give a stability version of the result. As an application of the stability version of the result, we obtain a clique version of the stability of the Erd\H{o}s-Gallai Theorem on matchings.