✦ LIBER ✦

On Regressive Ramsey Numbers

✍ Scribed by Peter Floodstrand Blanchard

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 111 KB
Volume: 100
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2002.3287

No coin nor oath required. For personal study only.

✦ Synopsis

for my mentors don bonar and gerald thompson

We prove the following relation between regressive and classical Ramsey numbers

¼ 8; R 4 reg ð6Þ ¼ 15; and R 5 reg ð7Þ536: We prove that R 2 xþk ð4Þ42 kþ1 ð3 þ kÞ À ðk þ 1Þ; and use this to compute R 2 reg ð5Þ ¼ 15: Finally, we provide the bounds 1954R 2 reg ð6Þ4 5 Á 2 42 þ 2 39 À 2: # 2002 Elsevier Science (USA)

📜 SIMILAR VOLUMES

Regressive Ramsey Numbers Are Ackermanni

Regressive Ramsey Numbers Are Ackermannian

✍ Menachem Kojman; Saharon Shelah 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 86 KB

We give an elementary proof of the fact that regressive Ramsey numbers are Ackermannian. This fact was first proved by Kanamori and McAloon with mathematical logic techniques. ## 1999 Academic Press Nous vivons encore sous le reÁ gne de la logique, voilaÁ , bien entendu, aÁ quoi je voulais en veni

On ramsey numbers for books

✍ C. C. Rousseau; J. Sheehan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 479 KB

For n = 1, 2, . . . , let 6, = K2+ K,,. We pose the problem of determining the Ramsey numbers r(&, B,) and demonstrate that in many cases critical colorings are available from known examples of strongly regular graphs.

Planar Ramsey Numbers

✍ R. Steinberg; C.A. Tovey 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 240 KB

The planar Ramsey number \(P R(k, l)(k, l \geqslant 2)\) is the smallest integer \(n\) such that any planar graph on \(n\) vertices contains either a complete graph on \(k\) vertices or an independent set of size \(l\). We find exact values of \(P R(k, l)\) for all \(k\) and \(l\). Included is a pro

On graphs with linear Ramsey numbers

✍ R. L. Graham; V. Rödl; A. Ruciński 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

On irredundant Ramsey numbers for graphs

✍ Johannes H. Hattingh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest p such that in every two‐coloring of the edges of __K~p~__ using colors red (__R__) and blue (__B__), either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. We

On graphs with small Ramsey numbers

✍ A. V. Kostochka; V. Rödl 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract Let __R__(__G__) denote the minimum integer __N__ such that for every bicoloring of the edges of __K~N~__, at least one of the monochromatic subgraphs contains __G__ as a subgraph. We show that for every positive integer __d__ and each γ,0 < γ < 1, there exists __k__ = __k__(__d__,γ) su