Abstract
AbstractGiven
$\alpha \gt 0$
and an integer
$\ell \geq 5$
, we prove that every sufficiently large
$3$
-uniform hypergraph
$H$
on
$n$
vertices in which every two vertices are contained in at least
$\alpha 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ý.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference13 articles.
1. [1] Balogh, J. , Clemen, F. C. and Lidický, B. (2021) Hypergraph Turán Problems in $\ell _2$ -Norm. arXiv preprint arXiv: 2108.10406.
2. [10] Mubayi, D. , Pikhurko, O. and Sudakov, B. (2011) Hypergraph Turán Problem: Some Open Questions. https://homepages. https://homepages.
3. On a Turán problem in weakly quasirandom 3-uniform hypergraphs
4. A problem of Erdős and Sós on 3-graphs
5. Co-degree density of hypergraphs
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献