✦ LIBER ✦

On Ramsey—Turán type theorems for hypergraphs

✍ Scribed by P. Erdős; Vera T. Sós

Book ID: 110564283
Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 273 KB
Volume: 2
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579235

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Ramsey-Turán type results for hyper

Some Ramsey-Turán type results for hypergraphs

✍ P. Frankl; V. Rödl 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 482 KB

On a Ramsey-Turán type problem

✍ Béla Bollobás; Paul Erdös 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 128 KB

A hypergraph extension of Turán's theore

A hypergraph extension of Turán's theorem

✍ Dhruv Mubayi 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 181 KB

More results on Ramsey—Turán type proble

More results on Ramsey—Turán type problems

✍ P. Erdős; A. Hajnal; Vera T. Sós; E. Szemerédi 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 593 KB

Note on a Ramsey-Turán type problem

✍ Vojtêch Rödl 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 125 KB

On Ramsey-Turán type problems in tournam

On Ramsey-Turán type problems in tournaments

✍ A Bialostocki; N Sauer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Let Tbe a tournament and let c :e(T)--> {1 ..... r} be an r-colouring of the edges of T. The associated reachability graph, denoted by R(T, c) is a directed graph whose vertices are the vertices of T, and a vertex v of R(T, c) dominates a vertex u of R(T, c) iff there is a monochromatic directed pat