On the Turán number of blow-ups of F5

Abstract

Let F5 denote the 3-uniform hypergraph on the vertex set \f1,f2,…,f5\ with hyperedges \f1f2f3,f1f2f4,f3f4f5\. Recently, Balogh, Clemen and Luo determined the Turán number of a one-vertex blow-up of F5, more specifically, they blow up the vertex f5 to t vertices, the resulting hypergraph is denoted by F5(f5;t). They show that for infinitely many t, F5(f5;t) has exponentially many extremal constructions and positive Turán density. In this paper, we determine the exact Turán number of the hypergraph obtained by blowing up f3 of F5 to t vertices and show that it also has exponentially many extremal constructions. We also give a general upper bound and lower bound of the Turán number of every blow-up of F5. For some special blow-ups of F5, for example, t-disjoint copies of F5, we determine the exact Turán number. We construct a hypergraph Fsim(t) which is a subgraph of a blow-up of F5, and is contained in the hypergraph obtained by adding any new hyperedge to the Turán hypergraph (the balanced complete 3-partite hypergraph), but its extremal construction is not the Turán hypergraph. We also determine the exact Turán number of Fsim(t).

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…