✦ LIBER ✦

Some Ramsey numbers for directed graphs

✍ Scribed by J.C. Bermond

Book ID: 107748175
Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 822 KB
Volume: 9
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90077-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local Ramsey numbers for some graphs

✍ Halina Bielak 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 166 KB

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

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

Ramsey Numbers of Some Bipartite Graphs

Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs

✍ Tao Jiang; Michael Salerno 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 147 KB