Turan numbers of extensions

被引:22
作者
Norin, Sergey [1 ]
Yepremyan, Liana [2 ]
机构
[1] McGill Univ, Dept Math & Stat, Montreal, PQ, Canada
[2] Univ Oxford, Math Inst, Oxford, England
基金
欧洲研究理事会; 加拿大自然科学与工程研究理事会;
关键词
Turan number; Extensions; Expansions; Hypergraphs; Stability method; Blowup; Critical; Lagrangian function; Covers pairs; GRAPHS;
D O I
10.1016/j.jcta.2017.08.004
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The extension of an r-uniform hypergraph g is obtained from it by adding for every pair of vertices of g, which is not covered by an edge in g, an extra edge containing this pair and (r-2) new vertices. Keevash [3] and Sidorenko [9] have previously determined Turan densities of two families of hypergraph extensions. We determine the Turan numbers for these families, using classical stability techniques and new tools introduced in [5]. (C) 2017 Published by Elsevier Inc.
引用
收藏
页码:476 / 492
页数:17
相关论文
共 10 条
[1]   Stability and Turan Numbers of a Class of Hypergraphs via Lagrangians [J].
Brandt, Axel ;
Irwin, David ;
Iang, Tao J. .
COMBINATORICS PROBABILITY & COMPUTING, 2017, 26 (03) :367-405
[2]   ON EXTREMAL PROBLEMS OF GRAPHS AND GENERALIZED GRAPHS [J].
ERDOS, P .
ISRAEL JOURNAL OF MATHEMATICS, 1964, 2 (03) :183-&
[3]  
Keevash P., 2011, Surv. Combin, P83, DOI [10.1017/CBO9781139004114.004, DOI 10.1017/CBO9781139004114.004]
[4]   A hypergraph extension of Turan's theorem [J].
Mubayi, D .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (01) :122-134
[5]   Turan number of generalized triangles [J].
Norin, S. ;
Yepremyan, L. .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2017, 146 :312-343
[6]   An exact turan result for the generalized triangle [J].
Pikhurko, Oleg .
COMBINATORICA, 2008, 28 (02) :187-208
[8]   Applications of the regularity lemma for uniform hypergraphs [J].
Rödl, V ;
Skokan, J .
RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (02) :180-194
[9]   ASYMPTOTIC SOLUTION FOR A NEW CLASS OF FORBIDDEN R-GRAPHS [J].
SIDORENKO, AF .
COMBINATORICA, 1989, 9 (02) :207-215
[10]  
Simonovits M., 1968, Theory of Graphs, P279