The mm-bipartite Ramsey number of the K2,2K_{2,2} versus K6,6K_{6,6}

preprint2022arXivOpen access

Abstract

Given bipartite graphs G1,…,GnG_1, \ldots, G_n, the bipartite Ramsey number BR(G1,…,Gn)BR(G_1,\ldots, G_n) is the last integer bb such that any complete bipartite graph Kb,bK_{b,b} with edges coloured with colours 1,2,…,n1,2,\ldots,n contains a copy of some GiG_i (1≤i≤n1\leq i\leq n) where all edges of GiG_i have colour ii. As another view of bipartite Ramsey numbers, for given bipartite graphs G1,…,GnG_1, \ldots, G_n and a positive integer mm, the mm-bipartite Ramsey number BRm(G1,…,Gn)BR_m(G_1, \ldots, G_n), is defined as the least integer bb, such that any complete bipartite graph Km,bK_{m,b} with edges coloured with colours 1,2,…,n1,2,\ldots,n contains a copy of some GiG_i (1≤i≤n1\leq i\leq n) where all edges of GiG_i have colour ii. The size of BRm(G1,G2)BR_m(G_1, G_2), where G1=K2,2G_1=K_{2,2} and G2∈{K3,3,K4,4}G_2\in \{K_{3,3}, K_{4,4}\} for each mm and the size of BRm(K3,3,K3,3)BR_m(K_{3,3}, K_{3,3}) and BRm(K2,2,K5,5)BR_m(K_{2,2}, K_{5,5}) for special values of mm, have been determined in several article up to now. In this article, we compute the size of BRm(K2,2,K6,6)BR_m(K_{2,2}, K_{6,6}) for some m≥2m\geq 2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.