The Turan density of triple systems is not principal

被引:7
作者
Balogh, J
机构
关键词
hypergraphs; triple system; Turan density; extremal number;
D O I
10.1006/jcta.2002.3285
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The Erdos-Stone-Simonovits Theorem implies that the Turan density of a family of graphs is the minimum of the Turn densities of the individual graphs from the family. It was conjectured by Mubayi and Rodl (J. Combin. Theory, Ser. A, submitted) that this is not necessarily true for hypergraphs, in particular for triple systems. We give an example, which shows that their conjecture is true. (C) 2002 Elsevier Science (USA).
引用
收藏
页码:176 / 180
页数:5
相关论文
共 2 条
[1]   AN EXACT RESULT FOR 3-GRAPHS [J].
FRANKL, P ;
FUREDI, Z .
DISCRETE MATHEMATICS, 1984, 50 (2-3) :323-328
[2]  
MUBAYI D, 2002, J COMBIN THEORY A, V100