Bounds for Bipartite Rainbow Ramsey Numbers
Sign Up to like & getrecommendations! Published in 2017 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-017-1794-3
Abstract: Given bipartite graphs G and H, the bipartite rainbow Ramsey number BRR(G; H) is the minimum integer N such that any edge-coloring of $$K_{N,N}$$KN,N with any number of colors contains either a monochromatic copy of G… read more here.
Keywords: brr brr; rainbow ramsey; bipartite rainbow; brr ... See more keywords