论文标题
小图的广义图恩问题
Generalized Turán problems for small graphs
论文作者
论文摘要
对于图形$ h $和$ f $，通用的Turán数字$ ex（n，h，f）$是$ n $ vertices上$ f $ fule-free Graph中$ h $的最多副本。当$ h $和$ f $最多有四个顶点时，我们会考虑这个问题。在几乎所有情况下，我们都会给出鲜明的结果，并将其余案例与众所周知的未解决问题联系起来。我们的主要新贡献是将Simonovits的渐进式诱导方法用于广义的Turán问题。
For graphs $H$ and $F$, the generalized Turán number $ex(n,H,F)$ is the largest number of copies of $H$ in an $F$-free graph on $n$ vertices. We consider this problem when both $H$ and $F$ have at most four vertices. We give sharp results in almost all cases, and connect the remaining cases to well-known unsolved problems. Our main new contribution is applying the progressive induction method of Simonovits for generalized Turán problems.
