Extremal problems for star forests and cliques

Yongchun Lu, Liying Kang

Given a family of graphs $\mathcal{F}$, the Turán number $ex(n,\mathcal{F})$ denotes the maximum number of edges in any $\mathcal{F}$-free graph on $n$ vertices. Recently, Alon an…