✦ LIBER ✦

On multicolor Ramsey numbers for complete bipartite graphs

✍ Scribed by Fan R.K Chung; R.L Graham

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 268 KB
Volume: 18
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(75)90043-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Ramsey Problem for Multicolor Bip

On the Ramsey Problem for Multicolor Bipartite Graphs

✍ W.A Carnielli; E.L Monte Carmelo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Given i, j positive integers, let K denote a bipartite complete graph and let i, j ## Ž . R m, n be the smallest integer a such that for any r-coloring of the edges of K r a, a one can always find a monochromatic subgraph isomorphic to K . In other m, n Ž . Ä 4 words, if a G R m, n then every mat

The size Ramsey number of a complete bip

The size Ramsey number of a complete bipartite graph

✍ P. Erdo˝s; C.C. Rousseau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Erd6s. P. and C.C. Rousseau, The size Ramsey number of a complete bipartite graph, Discrete Mathematics 113 (1993) 259-262. In this note we prove that the (diagonal) size Ramsey number of K,,.,, is bounded below by $2'2".

Topological Ramsey Theorem for Complete

Topological Ramsey Theorem for Complete Bipartite Graphs

✍ M.S. Miyauchi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 645 KB

On the path-complete bipartite Ramsey nu

On the path-complete bipartite Ramsey number

✍ Roland Häggkvist 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 130 KB

More rotation numbers for complete bipar

More rotation numbers for complete bipartite graphs

✍ Béla Bollobás; E. J. Cockayne 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

## Abstract Let __G__ be a simple undirected graph which has __p__ vertices and is rooted at __x__. Informally, the __rotation number h(G, x)__ of this rooted graph is the minimum number of edges in a __p__ vertex graph __H__ such that for each vertex __v__ of __H__, there exists a copy of __G__ in

On Book-Complete Graph Ramsey Numbers

✍ Yusheng Li; C.C. Rousseau 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 274 KB

It is shown that a graph of order N and average degree d that does not contain the book B m =K 1 +K 1, m as a subgraph has independence number at least Nf (d ), where f (x)t(log xÂx) (x Ä ). From this result we find that the book-complete graph Ramsey number satisfies r(B m , K n ) mn 2 Âlog(nÂe). I