✦ LIBER ✦

Ramsey Numbers for Matroids

✍ Scribed by Talmage James Reid

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 233 KB
Volume: 18
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1995.0112

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tripartite Ramsey numbers for paths

✍ András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract In this article, we study the tripartite Ramsey numbers of paths. We show that in any two‐coloring of the edges of the complete tripartite graph __K__(__n__, __n__, __n__) there is a monochromatic path of length (1 − __o__(1))2__n__. Since __R__(__P__~2__n__+1~,__P__~2__n__+1~)=3__n__,

Irredundant ramsey numbers for graphs

✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB

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

CO-irredundant Ramsey numbers for graphs

✍ E. J. Cockayne; G. MacGillivray; J. Simmons 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views

Constrained Ramsey numbers for rainbow m

Constrained Ramsey numbers for rainbow matching

✍ Allan Siu Lun Lo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

The Ramsey number R k (G) of a graph G is the minimum number N, such that any edge coloring of K N with k colors contains a monochromatic copy of G. The constrained Ramsey number f (G, T ) of the graphs G and T is the minimum number N, such that any edge coloring of K N with any number of colors con