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

TL;DR

This paper investigates the minimum number of colors needed to edge-color complete bipartite graphs so that no 2-colored cycle of length 2k appears, improving bounds and providing asymptotically sharp estimates.

Contribution

It improves bounds on the generalized Ramsey number for bipartite graphs avoiding 2-colored cycles, answering an open question and providing precise asymptotic estimates.

Findings

Improved upper and lower bounds on r(K_{n, n}, C_{2k}, 3)

Asymptotically sharp estimate for r(K_{n, n}, C_6, 3) = (7/20) n + o(n)

Answer to a question of Lane and Morrison

Abstract

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 note, we improve the upper and lower bounds on $r(K_{n, n}, C_{2k}, 3)$. Our upper bound answers a question of Lane and Morrison. For $k=3$ we obtain the asymptotically sharp estimate $r(K_{n, n}, C_6, 3) = \frac{7}{20} n + o(n)$.