✦ LIBER ✦

Ramsey numbers for local colorings

✍ Scribed by A. Gyárfás; J. Lehel; R. H. Schelp; ZS. Tuza

Publisher: Springer Japan
Year: 1987
Tongue: English
Weight: 759 KB
Volume: 3
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788549

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Three-Color Ramsey Numbers For Paths

✍ András Gyárfás; Miklós Ruszinkó*; Gábor N. Sárközy†; Endre Szemerédi 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 450 KB

Three-color Ramsey numbers for paths

✍ András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 325 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

Linear upper bounds for local Ramsey num

Linear upper bounds for local Ramsey numbers

✍ Miroslaw Truszczynski; Zsolt Tuza 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 486 KB

Local Ramsey Numbers for Copies of Cycle

Local Ramsey Numbers for Copies of Cycles

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