Edge-coloring $K_{n,n}$ with no 2-colored $C_{2k}$

Deepak Bal, Patrick Bennett

The generalized Ramsey number $r(G,H,q)$ is the minimum number of colors needed to color the edges of $G$ such that every isomorphic copy of $H$ has at least $q$ colors. In this…