论文标题
在广义的Turán问题上
On the extremal graphs in generalized Turán problems
论文作者
论文摘要
给定两个图$ h $和$ f $，通用的Turán数字$ \ Mathrm {ex}（n，h，h，f）$是$ n $ vertex $ f $ f $ free Graph中最大的$ h $副本。对于每个$ f $和足够大的$ n $，我们为广义的Turán问题提供一个极端图，即$ f $ f $ n $ n $ n $顶点图$ g $对于某些$ h $包含$ \ mathrm {exrm {ex}（ex ex}（ex}）（ex}（n，h，h，h，h，f）$ h $ $ h $。
Given two graphs $H$ and $F$, the generalized Turán number $\mathrm{ex}(n,H,F)$ is the largest number of copies of $H$ in an $n$-vertex $F$-free graph. For every $F$ and sufficiently large $n$, we present an extremal graph for a generalized Turán problem, i.e., an $F$-free $n$ vertex graph $G$ that for some $H$ contains exactly $\mathrm{ex}(n,H,F)$ copies of $H$.
