Title of article
An Upper Bound for the Turلn Number t3(n, 4)
Author/Authors
Chung، نويسنده , , Fan and Lu، نويسنده , , Linyuan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
9
From page
381
To page
389
Abstract
Let tr(n, r+1) denote the smallest integer m such that every r-uniform hypergraph on n vertices with m+1 edges must contain a complete graph on r+1 vertices. In this paper, we prove thatlimn→∞ t3(n, 4)(n3)⩽3+1712=0.593592… .
Journal title
Journal of Combinatorial Theory Series A
Serial Year
1999
Journal title
Journal of Combinatorial Theory Series A
Record number
1530411
Link To Document