𝔖 Bobbio Scriptorium
✦   LIBER   ✦

More results on Ramsey—Turán type problems

✍ Scribed by P. Erdős; A. Hajnal; Vera T. Sós; E. Szemerédi

Book ID
110564388
Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
593 KB
Volume
3
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

Turán-Ramsey problems
Turán-Ramsey problems
✍ Béla Bollobás 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 278 KB

For i = 1,2 .... ,k, let Gi be a graph with vertex set [n] = {1 .... ,n} containing no Fi as a subgraph. At most how many edges are in G1 t3 -• • U Gk? We shall answer this Turfin-Ramseytype question asymptotically, and pose a number of related problems. Given graphs F1 ..... Fk, write exk(n,F 1 ..

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