A note on Turan number T(k+1,k,n)
Abstract
Tur\'an number is one of primary topics in the combinatorics of finite sets,in this paper, we will present a new upper bound for Tur\'an number.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.