𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A variant of the classical Ramsey problem

✍ Scribed by Paul Erdős; András Gyárfás

Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
478 KB
Volume
17
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A survey of bounds for classical Ramsey
A survey of bounds for classical Ramsey numbers
✍ F. R. K. Chung; C. M. Grinstead 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 546 KB

## Abstract This paper is a survey of the methods used for determining exact values and bounds for the classical Ramsey numbers in the case that the sets being colored are two‐element sets. Results concerning the asymptotic behavior of the Ramsey functions __R__(__k,l__) and __R~m~__(__k__) are als

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

A new upper bound for the bipartite Rams
A new upper bound for the bipartite Ramsey problem
✍ David Conlon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ ≥ 2^_