✦ LIBER ✦

Ramsey numbers for transitive tournaments

✍ Scribed by S.A. Choudum; B. Ponnusamy

Book ID: 108316323
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 156 KB
Volume: 206
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00396-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey numbers for triples

✍ H.L. Abbott; A.C. Liu 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Ramsey Numbers for Matroids

✍ Talmage James Reid 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 233 KB

On Ramsey numbers for circuits

✍ H.L Abbott 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Ramsey numbers for local colorings

✍ A. Gyárfás; J. Lehel; R. H. Schelp; ZS. Tuza 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 759 KB

Upper bounds for Ramsey numbers

✍ Lingsheng Shi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Ramsey numbers for sparse graphs

✍ Nancy Eaton 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We consider a class of graphs on n vertices, called (d,f)-arrangeable graphs. This class of graphs contains all graphs of bounded degree d, and all df-arrangeable graphs, a class introduced by Chen and Schelp in 1993. In 1992, a variation of the Regularity Lemma of Szemer6di was introduced by Eaton