On some extremal problems on r-graphs
✍
P. Erdös
📂
Article
📅
1971
🏛
Elsevier Science
🌐
English
⚖ 499 KB
Abslract. Denote by @)(n; k) an ~-graph of n vcrtieca and k r-tuples. Turin's classical problem states: Detomline the smailcst integer f(n;r, I) so that cvcry G%; f(n; r, I)) contains a K@)(I). Tur&n determined f (n; r, I) for r = 2, but nothing is known for r > ?. Put lim,,f(n; t, O/(y) = c,,~ The