✦ LIBER ✦

Upper Bounds for a Ramsey Theorem for Trees

✍ Scribed by C. J. Swanepoel; L. M. Pretorius

Publisher: Springer Japan
Year: 1994
Tongue: English
Weight: 299 KB
Volume: 10
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02986688

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Upper Bounds for Ramsey Numbers

✍ Y.R Huang; K.M Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 79 KB

The Ramsey number R(G 1 , G 2 ) is the smallest integer p such that for any graph Some new upper bound formulas are obtained for R(G 1 , G 2 ) and R(m, n), and we derive some new upper bounds for Ramsey numbers here.

Asymptotic Upper Bounds for Ramsey Funct

Asymptotic Upper Bounds for Ramsey Functions

✍ Yusheng Li; Cecil C. Rousseau; Wenan Zang 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 90 KB

An upper bound for ramsey numbers

✍ Yusheng Li; C.C Rousseau; Wenan Zang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Linear upper bounds for local Ramsey num

Linear upper bounds for local Ramsey numbers

✍ Miroslaw Truszczynski; Zsolt Tuza 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 486 KB

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

Some upper bounds for minimal trees

✍ J.M. Basart 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 553 KB