𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Size bipartite Ramsey numbers

✍ Scribed by Yuqin Sun; Yusheng Li

Book ID
108113963
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
356 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A bipartite Ramsey number
A bipartite Ramsey number
✍ Geoffrey Exoo πŸ“‚ Article πŸ“… 1991 πŸ› Springer Japan 🌐 English βš– 101 KB
Star-path bipartite Ramsey numbers
Star-path bipartite Ramsey numbers
✍ Johannes H. Hattingh; Michael A. Henning πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 213 KB

For bipartite graphs G1,G2 ..... Gk, the bipartite Ramsey number b(GI,G2,...,Gk) is the least positive integer b so that any colouring of the edges of Kb, b with k colours will result in a copy of Gi in the ith colour for some i. In this note, we establish the exact value of the bipartite Ramsey num

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".

Bipartite anti-Ramsey numbers of cycles
Bipartite anti-Ramsey numbers of cycles
✍ Maria Axenovich; Tao Jiang; AndrΓ© KΓΌndgen πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 265 KB

## Abstract We determine the maximum number of colors in a coloring of the edges of __K~m,n~__ such that every cycle of length 2__k__ contains at least two edges of the same color. One of our main tools is a result on generalized path covers in balanced bipartite graphs. For positive integers __q__