✦ LIBER ✦

On globally sparse Ramsey graphs

✍ Scribed by Mütze, Torsten; Peter, Ueli

Book ID: 121249803
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 498 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.07.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse ramsey graphs

✍ Jaroslav Nešetřil; Vojtěch Rödl 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 346 KB

Sparse Anti-Ramsey Graphs

✍ Y. Kohayakawa; T. Luczak 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 269 KB

It is shown that for every $l \geqslant 3$ there exists a graph $G$ of girth / such that in any proper edge-colouring of $G$ one may find a cycle of length / all of whose edges are given different colours. 1995 Academic Press. Inc.

Multipartite graph—Sparse graph Ramsey n

Multipartite graph—Sparse graph Ramsey numbers

✍ P. Erdős; R. J. Faudree; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 400 KB

Ramsey numbers for sparse graphs

✍ Nancy Eaton 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We consider a class of graphs on n vertices, called (d,f)-arrangeable graphs. This class of graphs contains all graphs of bounded degree d, and all df-arrangeable graphs, a class introduced by Chen and Schelp in 1993. In 1992, a variation of the Regularity Lemma of Szemer6di was introduced by Eaton

Linear Ramsey numbers of sparse graphs

✍ Lingsheng Shi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract The Ramsey number __R__(__G__~1~,__G__~2~) of two graphs __G__~1~ and __G__~2~ is the least integer __p__ so that either a graph __G__ of order __p__ contains a copy of __G__~1~ or its complement __G__^c^ contains a copy of __G__~2~. In 1973, Burr and Erdős offered a total of $25 for se

On the Ramsey Number of Sparse 3-Graphs

✍ Brendan Nagle; Sayaka Olsen; Vojtěch Rödl; Mathias Schacht 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 246 KB