𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Star-path bipartite Ramsey numbers

✍ Scribed by Johannes H. Hattingh; Michael A. Henning


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
213 KB
Volume
185
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


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 number b(Pm,Kl,,) for all integers re, n>.2, where Pm denotes a path on m vertices.


πŸ“œ SIMILAR VOLUMES


Path-Star Ramsey numbers
✍ T.D Parsons πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 373 KB
A bipartite Ramsey number
✍ Geoffrey Exoo πŸ“‚ Article πŸ“… 1991 πŸ› Springer Japan 🌐 English βš– 101 KB
Path-cycle Ramsey numbers
✍ R.J. Faudree; S.L. Lawrence; T.D. Parsons; R.H. Schelp πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 1000 KB

I Retaefltiy, Ramsey numbers have been obtained for several &sses of graphs. In particthey have been studied for hs of low wder, pairs of paths, paks of cycles, and for a . In this paper, th rs atie obtained fair aI3 pa&cycle pairs,

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__

Path Ramsey numbers in multicolorings
✍ R.J Faudree; R.H Schelp πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 619 KB