✦ LIBER ✦

Degree Ramsey numbers for cycles and blowups of trees

✍ Scribed by Tao Jiang; Kevin G. Milans; Douglas B. West

Book ID: 118275954
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 260 KB
Volume: 34
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.08.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey Numbers for Trees of Small Maximu

Ramsey Numbers for Trees of Small Maximum Degree

✍ P. E. Haxell; T. Łuczak; P. W. Tingley 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 416 KB

The on-line degree Ramsey number of cycl

The on-line degree Ramsey number of cycles

✍ Rolnick, David 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Local and Mean Ramsey Numbers for Trees

✍ B. Bollobás; A. Kostochka; R.H. Schelp 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 75 KB

In this note we find the local and mean k-Ramsey numbers for many trees for which the Erdo s So s tree conjecture holds. ## 2000 Academic Press The usual Ramsey number R(G, k) is the smallest positive integer n such that any coloring of the edges of K n by at most k colors contains a monochromatic

Local Ramsey numbers for copies of cycle

Local Ramsey numbers for copies of cycles

✍ Halina Bielak 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 485 KB

We prove that the 2-local Ramsey number

Local Ramsey Numbers for Copies of Cycle

Local Ramsey Numbers for Copies of Cycles

✍ Halina Bielak 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Multipartite Ramsey numbers for odd cycl

Multipartite Ramsey numbers for odd cycles

✍ András Gyárfás; Gábor N. Sárközy; Richard H. Schelp 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

## Abstract In this paper we study multipartite Ramsey numbers for odd cycles. We formulate the following conjecture: Let __n__≥5 be an arbitrary positive odd integer; then, in any two‐coloring of the edges of the complete 5‐partite graph __K__((__n__−1)/2, (__n__−1)/2, (__n__−1)/2, (__n__−1)/2, 1)