Abstract
Given bipartite graphs , the bipartite Ramsey number is the last integer such that any complete bipartite graph with edges coloured with colours contains a copy of some () where all edges of have colour . As another view of bipartite Ramsey numbers, for given bipartite graphs and a positive integer , the -bipartite Ramsey number , is defined as the least integer , such that any complete bipartite graph with edges coloured with colours contains a copy of some () where all edges of have colour . The size of , where and for each and the size of and for special values of , have been determined in several article up to now. In this article, we compute the size of for some .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.