The Tur\'an density of the tight 5-cycle minus one edge

Abstract

Let the tight -cycle minus one edge C3- be the 3-graph on \1,…,\ consisting of -1 consecutive triples in the cyclic order. We show that, for every 5 not divisible by 3, the Tur\'an density of C3- is 1/4 and also prove some finer structure results. This proves a conjecture of Mubayi--Sudakov--Pikhurko from 2011 and extends the results of Balogh--Luo [Combinatorica 44 (2024) 949--976] who established analogous claims for all sufficiently large . Results similar to ours were independently obtained by Lidick\'y--Mattes--Pfender [arXiv:2409.14257].

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…