✦ LIBER ✦

The Analogue of Ramsey Numbers for Planar Graphs

✍ Scribed by Walker, K.

Book ID: 120094004
Publisher: Oxford University Press
Year: 1969
Tongue: English
Weight: 93 KB
Volume: 1
Category: Article
ISSN: 0024-6093
DOI: 10.1112/blms/1.2.187

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The planar Ramsey number

✍ Chen, Yaojun; Cheng, T.C.E.; Zhang, Yunqing; Zhou, Guofei 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Ramsey-Paris-Harrington numbers for grap

Ramsey-Paris-Harrington numbers for graphs

✍ George Mills 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 390 KB

Some Ramsey numbers for directed graphs

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