Exact computation of the hypergraph Turan function for expanded complete 2-graphs

被引：33

作者：

Pikhurko, Oleg ^{[1
]}

机构：

[1] Univ Warwick, Inst Math, Coventry CV4 7AL, W Midlands, England

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2013年 / 103卷 / 02期

关键词：

k-uniform hypergraph; Stability property; Turan density; Turan function; REGULARITY LEMMA; TRIPLE-SYSTEMS; NUMBER; GRAPHS;

D O I：

10.1016/j.jctb.2012.09.005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let I > k >= 3. Let the k-graph H-l((k)) be obtained from the complete 2-graph K-l((2)) by enlarging each edge with a new set of k - 2 vertices. Mubayi [A hypergraph extension of Turan's theorem, J. Combin. Theory Ser. B 96 (2006) 122-134] computed asymptotically the Turan function ex(n, H-l((k))). Here we determine the exact value of ex(n, H-l((k))) for all sufficiently large n, settling a conjecture of Mubayi. (C) 2012 Elsevier Inc. All rights reserved.

引用

页码：220 / 225

页数：6

共 21 条

[1] The Turan density of triple systems is not principal [J].