𝔖 Bobbio Scriptorium
✦   LIBER   ✦

More Constructive Lower Bounds on Classical Ramsey Numbers

✍ Scribed by Xu, Xiaodong; Shao, Zehui; Radziszowski, StanisŁaw P.

Book ID
118197149
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
154 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New lower bounds for seven classical Ram
New lower bounds for seven classical Ramsey numbers
✍ Kang Wu; Wenlong Su; Haipeng Luo; Xiaodong Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 346 KB

New lower bounds for seven classical Ramsey numbers are obtained by considering some circulant graphs G n (A i ) with n ≥ 142 whose orders might be either prime or not. The results are

Lower bounds for lower Ramsey numbers
Lower bounds for lower Ramsey numbers
✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

A constructive approach for the lower bo
A constructive approach for the lower bounds on the Ramsey numbers R (s, t)
✍ Xu Xiaodong; Xie Zheng; Stanisław P. Radziszowski 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

## Abstract Graph __G__ is a (__k__, __p__)‐graph if __G__ does not contain a complete graph on __k__ vertices __K__~__k__~, nor an independent set of order __p__. Given a (__k__, __p__)‐graph __G__ and a (__k__, __q__)‐graph __H__, such that __G__ and __H__ contain an induced subgraph isomorphic t