论文标题
一些稳定性和确切的导致广义的Turán问题
Some stability and exact results in generalized Turán problems
论文作者
论文摘要
给定图形$ h $和$ f $，广义的Turán数字$ \ MATHRM {ex}（n，h，f）$是$ n $ n $ -vertex $ f $ f $ free Graphs中最大的$ h $的副本。稳定性是指通常的现象，即如果$ n $ vertex $ f $ f $ f $ f $ g $包含$ \ mathrm {ex}（n，h，h，f）$ h $的$ h $副本，而不是$ g $，那么在某种意义上与某些极端图相似。我们为广义的Turán问题获得了新的稳定结果，并得出了几个新的精确结果。
Given graphs $H$ and $F$, the generalized Turán number $\mathrm{ex}(n,H,F)$ is the largest number of copies of $H$ in $n$-vertex $F$-free graphs. Stability refers to the usual phenomenon that if an $n$-vertex $F$-free graph $G$ contains almost $\mathrm{ex}(n,H,F)$ copies of $H$, than $G$ is in some sense similar to some extremal graph. We obtain new stability results for generalized Turán problems and derive several new exact results.
