✦ LIBER ✦

Local Ramsey numbers for some graphs

✍ Scribed by Halina Bielak

Book ID: 108315851
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 166 KB
Volume: 266
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00800-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local and Mean Ramsey Numbers for Some G

Local and Mean Ramsey Numbers for Some Graphs

✍ Halina Bielak 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Some Ramsey numbers for directed graphs

✍ J.C. Bermond 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 822 KB

Local and meank-Ramsey numbers for compl

Local and meank-Ramsey numbers for complete graphs

✍ Schelp, R. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 2 views

This paper establishes that the local k-Ramsey number R(K m , k -loc) is identical with the mean k-Ramsey number R(K m , k -mean). This answers part of a question raised by Caro and Tuza.

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

Lower Ramsey numbers for graphs

✍ C.M. Mynhardt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Let p(G) denote the smallest number of vertices in a maximal clique of the graph G, while i(G) (the independent domination number of G) denotes the smallest number of vertices in a maximal independent (i.e. independent dominating) set of G. For given integers 1 and m, the lower Ramsey number s(l, m)

Irredundant ramsey numbers for graphs

✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB