On hypergraphs with every four points spanning at most two triples

被引:0
|
作者
Mubayi, D [1 ]
机构
[1] Univ Illinois, Dept Math Stat & Comp Sci, Chicago, IL 60607 USA
来源
ELECTRONIC JOURNAL OF COMBINATORICS | 2003年 / 10卷 / 01期
关键词
hypergraph Turan numbers;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let F be a triple system on an n element set. Suppose that F contains more than (1/3 - epsilon) (n3) triples, where epsilon > 10(-6) is explicitly defined and n is sufficiently large. Then there is a set of four points containing at least three triples of F. This improves previous bounds of de Caen [1] and Matthias [7].
引用
收藏
页数:4
相关论文
共 50 条