𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On A Hypergraph Turán Problem Of Frankl

✍ Scribed by Peter Keevash; Benny Sudakov*

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
414 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multipartite Turán problem for connected
Multipartite Turán problem for connected graphs and hypergraphs
✍ Zsolt Tuza 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Tuza, Z., Multipartite Turan problem for connected graphs and hypergraphs, Discrete Mathematics 112 (1993) 199-206. Giving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum number of edges in a k-chromatic graph G with color classes of given cardinalities n,, , n,,

On a Ramsey-Turán type problem
On a Ramsey-Turán type problem
✍ Béla Bollobás; Paul Erdös 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 128 KB