论文标题
紧密周期的CodgreeTurán密度减去一个边缘
The codegree Turán density of tight cycles minus one edge
论文作者
论文摘要
给定$α> 0 $和一个整数$ \ ell \ geq5 $，我们证明，每一个足够大的$ 3 $均匀的超graph $ h $上的$ n $顶点上，其中每个两个顶点至少包含在$αn$ edges中，其中包含$ c_ \ ell^ell^eell^{ - } $的副本，$ c_ \ ell^{ - } $ cy tency $ tence $ \ el ell certices cortices nice Ell cortices nice Ell vertice cortices nice Ell vertices。这改善了Balogh，Clemen和Lidický的先前结果。
Given $α>0$ and an integer $\ell\geq5$, we prove that every sufficiently large $3$-uniform hypergraph $H$ on $n$ vertices in which every two vertices are contained in at least $αn$ edges contains a copy of $C_\ell^{-}$, a tight cycle on $\ell$ vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidický.
