English

Turan numbers of extensions of some sparse hypergraphs via Lagrangians

Combinatorics 2016-09-29 v1

Abstract

Given a positive integer nn and an rr-uniform hypergraph (or rr-graph for short) FF, the Turan number ex(n,F)ex(n,F) of FF is the maximum number of edges in an rr-graph on nn vertices that does not contain FF as a subgraph. The extension HFH^F of FF is obtained as follows: For each pair of vertices vi,vjv_i,v_j in FF not contained in an edge of FF, we add a set BijB_{ij} of r2r-2 new vertices and the edge {vi,vj}Bij\{v_i,v_j\} \cup B_{ij}, where the BijB_{ij} 's are pairwise disjoint over all such pairs {i,j}\{i,j\}. Let KprK^r_p denote the complete rr-graph on pp vertices. For all sufficiently large nn, we determine the Turan numbers of the extensions of a 33-uniform tt-matching, a 33-uniform linear star of size tt, and a 44-uniform linear star of size tt, respectively. We also show that the unique extremal hypergraphs are balanced blowups of K3t13,K2t3K^3_{3t-1}, K^3_{2t}, and K3t4K^4_{3t}, respectively. Our results generalize the recent result of Hefetz and Keevash [7].

Keywords

Cite

@article{arxiv.1609.08983,
  title  = {Turan numbers of extensions of some sparse hypergraphs via Lagrangians},
  author = {Tao Jiang and Yuejian Peng and Biao Wu},
  journal= {arXiv preprint arXiv:1609.08983},
  year   = {2016}
}

Comments

21 pages