Abstract
For bipartite graphs \(G_1, G_2,\ldots ,G_k\), the bipartite Ramsey number \(b(G_1,G_2\), \(\ldots , G_k)\) is the least positive integer b so that any colouring of the edges of \(K_{b,b}\) with k colours will result in a copy of \(G_i\) in the ith colour for some i. In this paper, we will consider the bipartite Ramsey number \(b(C_{2t_1},C_{2t_2},\ldots ,C_{2t_k})\), where \(t_{i}\) is an integer and \(2 \le t_{i}\le 4,\) for all \(1\le i\le k\). In particular, we will show that \(b(C_{2t_1},C_{2t_2},\ldots ,C_{2t_k})\) \(\le \) \(k(t_1+t_2+\cdots +t_k-k+1)\).
Similar content being viewed by others
References
Bahls, P., Spencer, T.S.: On the ramsey numbers of trees with small diameter. Graphs Combin. 29, 39–44 (2013)
Burr, S.A., Roberts, J.A.: On Ramsey numbers for stars. Util. Math. 4, 217–220 (1973)
Chartrand, G., Lesniak, L.: Graphs and Digraphs, 3rd edn. Chapman & Hall, London (1996)
Chung, F.R.K., Graham, R.L.: On multicolor Ramsey numbers for complete bipartite graphs. J. Combin. Theory (B) 18, 164–169 (1975)
Erdös, P., Rado, R.: A partition calculus in set theory. Bull. Amer. Math. Soc 62, 229–489 (1956)
Erdös, P., Gallai, T.: On maximal paths and circuits of graphs. Acta. Math. Acad. Scient. Hung. 10, 337–356 (1959)
Guo, Y., Volkmann, L.: Tree-Ramsey numbers. Australas. J. Combin. 11, 169–175 (1995)
Hattingh, J.H., Henning, M.A.: Bipartite Ramsey theory. Util. Math. 53, 217–230 (1998)
Hattingh, J.H., Henning, M.A.: Star-path bipartite Ramsey numbers. Discrete Math. 185, 255–258 (1998)
Naor, H., Verstraëte, J.: A note on bipartite graphs without 2k-cycles. Combin. Probab. Comput. 14, 845–849 (2005)
Zhang, R., Sun, Y., Wu, Y.: The bipartite ramsey numbers \(b(C_{2m}; C_{2n})\). Int. J. Math. Comp. Sci. Eng. 7, 42–45 (2013)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Joubert, E.J. Some Generalized Bipartite Ramsey Numbers Involving Short Cycles. Graphs and Combinatorics 33, 433–448 (2017). https://doi.org/10.1007/s00373-017-1761-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-017-1761-z