✦ LIBER ✦

The on-line degree Ramsey number of cycles

✍ Scribed by Rolnick, David

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree Ramsey numbers for cycles and blo

Degree Ramsey numbers for cycles and blowups of trees

✍ Tao Jiang; Kevin G. Milans; Douglas B. West 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 260 KB

A note on cycle Ramsey numbers

✍ Gary Chartrand; Seymour Schuster 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 283 KB

On cycle—Complete graph ramsey numbers

✍ P. Erdös; R. J. Faudree; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 507 KB

A new upper bound is given for the cycle-complete graph Ramsey number r(Cm, K,,), the smallest order for a graph which forces it to contain either a cycle of order m or a set of n independent vertices. Then, another cycle-complete graph Ramsey number is studied, namely r(sCm, K,) the smallest order

On the multi-colored Ramsey numbers of c

On the multi-colored Ramsey numbers of cycles

✍ Tomasz Łuczak; Miklós Simonovits; Jozef Skokan 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB

For a graph L and an integer k ≥ 2, R k (L) denotes the smallest integer N for which for any edge-coloring of the complete graph K N by k colors there exists a color i for which the corresponding color class contains L as a subgraph.

The Ramsey number for hypergraph cycles

The Ramsey number for hypergraph cycles I

✍ P.E. Haxell; T. Łuczak; Y. Peng; V. Rödl; A. Ruciński; M. Simonovits; J. Skokan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 237 KB

The line analog of Ramsey numbers

✍ Mehdi Behzad; Heydar Radjavi 📂 Article 📅 1967 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 162 KB