𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructive lower bounds for off-diagonal Ramsey numbers

✍ Scribed by Noga Alon; Pavel Pudlák

Book ID
105618979
Publisher
The Hebrew University Magnes Press
Year
2001
Tongue
English
Weight
391 KB
Volume
122
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tidier Examples for Lower Bounds on Diag
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers
✍ Colin McDiarmid; Angelika Steger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 266 KB

There is a family (H k ) of graphs such that H k has order (1+o(1))(-2Âe) k 2 kÂ2 but has no clique or stable set of order k. This result of Spencer provides the best known lower bound for the diagonal Ramsey numbers R(k, k). Here we see that the graphs H k can be taken to be regular, self-complemen

New lower bounds of some diagonal Ramsey
New lower bounds of some diagonal Ramsey numbers
✍ Filip Guldan; Pavel Tomasta 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 1 views

A new construction of self-complementary graphs containing no Klo or K , is described. This construction gives the Ramsey number lower bounds r(10,lO) 2 458 and r(1 1,l 1 ) 2 542. The problem of determining the Ramsey numbers is known to be very difficult and so we are often satisfied with partial

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