𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A ramsey type problem concerning vertex colourings

✍ Scribed by Jason I Brown; Vojtěch Rödl

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
475 KB
Volume
52
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a problem concerning ordered colourin
On a problem concerning ordered colourings
✍ Louis Caccetta; Rui Zhong Jia 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Let G be a connected graph with v(G)>~2 vertices and independence number ~(G). G is critical if for any edge e of G: (i) ~(G -e) > ct(G), if e is not a cut edge of G, and , 2, ife is a cut edge and Gi, G2 are the two components of G-e.

On a Ramsey-type problem
On a Ramsey-type problem
✍ F. R. K. Chung 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB
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
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