Journal article Open Access

The Bipartite Ramsey Numbers b(C2m; C2n)

Rui Zhang; Yongqi Sun; and Yali Wu

Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b such that any subgraph G of the complete bipartite graph Kb,b, either G contains a copy of H1 or its complement relative to Kb,b contains a copy of H2. It is known that b(K2,2;K2,2) = 5, b(K2,3;K2,3) = 9, b(K2,4;K2,4) = 14 and b(K3,3;K3,3) = 17. In this paper we study the case that both H1 and H2 are even cycles, prove that b(C2m;C2n) ≥ m + n - 1 for m = n, and b(C2m;C6) = m + 2 for m ≥ 4.

Files (183.6 kB)
Name Size
15580.pdf
md5:c6bf0daafb6541d5c955f1866971a761
183.6 kB Download
2
4
views
downloads
All versions This version
Views 22
Downloads 44
Data volume 734.3 kB734.3 kB
Unique views 22
Unique downloads 33

Share

Cite as