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
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,
## 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__