On the Tur\'an number of blow-ups of $\mathcal{F}_5$
Xiamiao Zhao, Xin Cheng, D\'aniel Gerbner, Hilal Hama Karim, Shujing Miao, Yichen Wang, Junpeng Zhou

TL;DR
This paper determines the exact Turán numbers for certain blow-ups of a specific 3-uniform hypergraph, revealing complex extremal structures and providing bounds for all such blow-ups.
Contribution
It extends previous work by calculating Turán numbers for blow-ups of , including specific cases and general bounds, and introduces a new hypergraph with unique extremal properties.
Findings
Exact Ture1n number for blow-up of at vertex f_3
Existence of exponentially many extremal constructions
Determination of Ture1n number for specific blow-ups like t-disjoint copies
Abstract
Let denote the -uniform hypergraph on the vertex set with hyperedges . Recently, Balogh, Clemen and Luo determined the Tur\'an number of a one-vertex blow-up of , more specifically, they blow up the vertex to vertices, the resulting hypergraph is denoted by . They show that for infinitely many , has exponentially many extremal constructions and positive Tur\'an density. In this paper, we determine the exact Tur\'an number of the hypergraph obtained by blowing up of to vertices and show that it also has exponentially many extremal constructions. We also give a general upper bound and lower bound of the Tur\'an number of every blow-up of . For some special blow-ups of , for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
