Turan numbers of extensions of some sparse hypergraphs via Lagrangians

Abstract

Given a positive integer n and an r-uniform hypergraph (or r-graph for short) F, the Turan number ex(n,F) of F is the maximum number of edges in an r-graph on n vertices that does not contain F as a subgraph. The extension HF of F is obtained as follows: For each pair of vertices vi,vj in F not contained in an edge of F, we add a set Bij of r-2 new vertices and the edge \vi,vj\ Bij, where the Bij 's are pairwise disjoint over all such pairs \i,j\. Let Krp denote the complete r-graph on p vertices. For all sufficiently large n, we determine the Turan numbers of the extensions of a 3-uniform t-matching, a 3-uniform linear star of size t, and a 4-uniform linear star of size t, respectively. We also show that the unique extremal hypergraphs are balanced blowups of K33t-1, K32t, and K43t, respectively. Our results generalize the recent result of Hefetz and Keevash [7].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…