✦ LIBER ✦

Unordered Canonical Ramsey Numbers

✍ Scribed by Duncan C. Richer

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 87 KB
Volume: 80
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1980

No coin nor oath required. For personal study only.

✦ Synopsis

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 bounds (the latter via a construction) for CR(s, t) which are significantly tighter than the bestknown corresponding bounds for ER(2; s).

📜 SIMILAR VOLUMES

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

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.

Some small ramsey numbers

✍ M. Clancy 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB

## Abstract In previous work, the Ramsey numbers have been evaluated for all pairs of graphs with at most four points. In the present note, Ramsey numbers are tabulated for pairs __F__~1~, __F__~2~ of graphs where __F__~1~ has at most four points and __F__~2~ has exactly five points. Exact results

Some connected ramsey numbers

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

## Abstract A graph __G__ is co‐connected if both __G__ and its complement __Ḡ__ are connected and nontrivial. For two graphs __A__ and __B__, the connected Ramsey number __r__~c~(__A, B__) is the smallest integer __n__ such that there exists a co‐connected graph of order __n__, and if __G__ is a c

Mean Ramsey–Turán numbers

✍ Raphael Yuster 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract A ρ‐mean coloring of a graph is a coloring of the edges such that the average number of colors incident with each vertex is at most ρ. For a graph __H__ and for ρ ≥ 1, the __mean Ramsey–Turán number RT__(__n, H,ρ − mean__) is the maximum number of edges a ρ‐__mean__ colored graph with _