𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bounds and algorithms for parallel knock-out numbers

✍ Scribed by Hajo Broersma; Matthew Johnson; Daniël Paulusma

Book ID
108281438
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
627 KB
Volume
410
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds for ramsey numbers R(3, 3,
Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
✍ Wan, Honghui 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB 👁 2 views

In this paper we show that for n ≥ 4, R(3, 3, . . . , 3) < n!( e-e -1 + 3 2 ) + 1. Consequently, a new bound for Schur numbers is also given. Also, for even n ≥ 6, the Schur number S n is bounded by S n < n!( e-e -1 + 3 2 ) -n + 2.