Mono-multi bipartite Ramsey numbers, designs, and matrices

Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2. We restate the problem of determining BRR(K1, , Kr,s) in matrix form and prove estimates and exact values for several choices of the parameters. Our general bound uses F

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
• Keywords: Complete Bipartite Graph, JCT 2006, Monochromatic G1, Multicolored G2