𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ramsey's theorem—A new lower bound

✍ Scribed by Joel Spencer


Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
280 KB
Volume
18
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A lower bound for Ramsey's theorem
✍ Joram Hirschfeld 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 291 KB

For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i

New lower bounds of some diagonal Ramsey
✍ 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

New lower bounds for seven classical Ram
✍ 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

A lower bound for irredundant Ramsey num
✍ Michael Krivelevich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Given a graph G-(V,E), a vertex subset U C V is called irredundant if every vertex v E U either has no neighbours in U or there exists a vertex w E V\U such that v is the only neighbour of w in U. The irredundant Ramsey number s(m,n) is the smallest N such that any redblue edge colouring of K N yiel