Large monochromatic components in multicolored bipartite graphs

Louis DeBiasio, Robert A. Krueger, Gábor N. Sárközy

It is well-known that in every $r$-coloring of the edges of the complete bipartite graph $K_{m,n}$ there is a monochromatic connected component with at least $\frac{m+n}{r}$ vertice…