arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.5743math.COcs.DM
收藏

Tur{á}n阈值以上超图上Erdans的两个问题

Two questions of Erdős on hypergraphs above the Tur{á}n threshold}

Klas Markström

摘要:

对于普通图,已知任何边数大于$K_s$的Tur{á}n数的图$G$都必须包含$K_s$的几个副本和$K_{s+1}^-$的一个副本,$K_{s+1}^-$是在$s+1$顶点上有一条缺失边的完全图. Erdens问,对于$s$顶点上的完全3-一致超图$K^3_s$,是否也有同样的结果。在本说明中,我们表明,$n$的小值,$G$中的顶点数,答案是否定的$s=4$。对于第二个属性,即包含一个${K^3_{s+1}}^-$,我们表明,对于$s=4$的答案是否定的,以及所有大的$n$,通过证明的Tur{á}n密度的${K^3_5}^-$是大于$K^3_4$。

英文摘要:

For ordinary graphs it is known that any graph $G$ with more edges than the Tur{á}n number of $K_s$ must contain several copies of $K_s$, and a copy of $K_{s+1}^-$, the complete graph on $s+1$ vertices with one missing edge. Erdős asked if the same result is true for $K^3_s$, the complete 3-uniform hypergraph on $s$ vertices. In this note we show that for small values of $n$, the number of vertices in $G$, the answer is negative for $s=4$. For the second property, that of containing a ${K^3_{s+1}}^-$, we show that for $s=4$ the answer is negative for all large $n$ as well, by proving that the Tur{á}n density of ${K^3_5}^-$ is greater than that of $K^3_4$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑