✦ LIBER ✦

Rainbow Generalizations of Ramsey Theory: A Survey

✍ Scribed by Shinya Fujita; Colton Magnant; Kenta Ozeki

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 366 KB
Volume: 26
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0891-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a generalization of Ramsey theory

✍ Michael S. Jacobson 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 485 KB

Generalizations of a Ramsey-theoretic re

Generalizations of a Ramsey-theoretic result of chvátal

✍ Stefan A. Burr; Paul Erdös 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

## Abstract Chvátal has shown that if __T__ is a tree on __n__ points then __r__(__K~k~, T__) = (__k__ – 1) (__n__ – 1) + 1, where __r__ is the (generalized) Ramsey number. It is shown that the same result holds when __T__ is replaced by many other graphs. Such a __T__ is called __k__‐good. The res

Generalized Ramsey theory for graphs IV,

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph

✍ F. Harary; G. Prins 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB

A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t

Generalizations of tournaments: A survey

✍ Bang-Jensen, J�rgen; Gutin, Gregory 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB

We survey results concerning various generalizations of tournaments. The reader will see that tournaments are by no means the only class of directed graphs with a very rich structure. We describe, among numerous other topics mostly related to paths and cycles, results on hamiltonian paths and cycle

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

On a generalization of Ramsey numbers

✍ Paul Erdös; Patrik E. O'neil 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 685 KB

## Given the integers I, , k, , I, , k, , r , which satisfy the condition I,, I, >r> k,, k, > 0, we define m = N(Z,, k,;l,, k,;r) as the smallest integer with the following property: ifS is a set containing IS? points and the r-subsets of S are partitioned arbitrarily into two class~:s,