AI helps you reading Science
AI generates interpretation videos
AI extracts and analyses the key points of the paper to generate videos automatically
AI parses the academic lineage of this thesis
An Upper Bound for the Turán Number t3(n, 4)
Journal of Combinatorial Theory, Series A, no. 2 (1999): 381-389
Let t r ( 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 that lim n →∞ t 3 ( n , 4) ( n 3 ) ⩽ 3+ 17 12 =0.593592… .
PPT (Upload PPT)