𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some Ramsey-Turán type results for hypergraphs

✍ Scribed by P. Frankl; V. Rödl

Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
482 KB
Volume
8
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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
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

A Ramsey-type problem and the Turán numb
A Ramsey-type problem and the Turán numbers
✍ N. Alon; P. Erdős; D. S. Gunderson; M. Molloy 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

## Abstract For each __n__ and __k__, we examine bounds on the largest number __m__ so that for any __k__‐coloring of the edges of __K~n~__ there exists a copy of __K~m~__ whose edges receive at most __k−__1 colors. We show that for $k \ge \sqrt{n}\;+\,\Omega(n^{1/3})$, the largest value of __m__ i

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,,