𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on restricted vertex ramsey numbers

✍ Scribed by Tomasz Luczak; Sebastian Urbański

Publisher
Springer Netherlands
Year
1996
Tongue
English
Weight
158 KB
Volume
33
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on Ramsey numbers
A note on Ramsey numbers
✍ Miklós Ajtai; János Komlós; Endre Szemerédi 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 310 KB
A note on Ramsey numbers for books
A note on Ramsey numbers for books
✍ Vladimir Nikiforov; Cecil C. Rousseau 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The __book with n pages__ __B__~__n__~ is the graph consisting of __n__ triangles sharing an edge. The __book Ramsey number__ __r__(__B__~__m__~,__B__~__n__~) is the smallest integer __r__ such that either __B__~__m__~ ⊂ __G__ or __B__~__n__~ ⊂ __G__ for every graph __G__ of order __r__

A note on constructive methods for ramse
A note on constructive methods for ramsey numbers
✍ F. R. K. Chung 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB 👁 1 views

## Abstract Let __r(k__) denote the least integer __n__‐such that for any graph __G__ on __n__ vertices either __G__ or its complement G contains a complete graph __K__~k~ on __k__ vertices. in this paper, we prove the following lower bound for the Ramsey number __r(k__) by explicit construction: _

A note on upper bounds for some Ramsey n
A note on upper bounds for some Ramsey numbers
✍ Chiê Nara; Shun-ichi Tachibana 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.

A note on vertex orders for stability nu
A note on vertex orders for stability number
✍ Mahadev, N. V. R.; Reed, B. A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

We investigate vertex orders that can be used to obtain maximum stable sets by a simple greedy algorithm in polynomial time in some classes of graphs. We characterize a class of graphs for which the stability number can be obtained by a simple greedy algorithm. This class properly contains previousl