Answers are grounded in this paper and cite their sources.
Given α > 0 and an integer ≥ 5 , 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_ ⁻ , a tight cycle on vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidický.
No takes yet. Share an insight, caveat, or question.
Piga et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: