✦ LIBER ✦

Canonical Pattern Ramsey Numbers

✍ Scribed by Maria Axenovich; Robert E. Jamison

Publisher: Springer Japan
Year: 2005
Tongue: English
Weight: 400 KB
Volume: 21
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-005-0603-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unordered Canonical Ramsey Numbers

✍ Duncan C. Richer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 87 KB

We define a weak form of canonical colouring, based on that of P. Erdo s and R. Rado (1950, J. London Math. Soc. 25, 249 255). This yields a class of unordered canonical Ramsey numbers CR(s, t), again related to the canonical Ramsey numbers ER(2; s) of Erdo s and Rado. We present upper and lower bou

On Pattern Ramsey Numbers of Graphs

✍ Robert E. Jamison; Douglas B. West 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 252 KB

On Canonical Ramsey Numbers for Complete

On Canonical Ramsey Numbers for Complete Graphs versus Paths

✍ H. Lefmann; V. Rodl 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 405 KB

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

Induced Ramsey Numbers

✍ Y. Kohayakawa,; H. J. Prömel; V. Rödl 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 378 KB

Difference Ramsey Numbers and Issai Numb

Difference Ramsey Numbers and Issai Numbers

✍ Aaron Robertson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 80 KB

We present a recursive algorithm for finding good lower bounds for the classical Ramsey numbers. Using notions from this algorithm we then give some results for generalized Schur numbers, which we call Issai numbers.