𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ramsey-Paris-Harrington numbers for graphs

✍ Scribed by George Mills

Book ID
107884997
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
390 KB
Volume
38
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ramsey numbers for sparse graphs
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
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
Irredundant ramsey numbers for graphs
✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 356 KB