Growth rates of the bipartite Erdős–Gyárfás function

Abstract

Given two graphs and a positive integer , an ‐coloring of is an edge‐coloring of such that every copy of in receives at least distinct colors. The bipartite Erdős–Gyárfás function is defined to be the minimum number of colors needed for to have a ‐coloring. For balanced complete bipartite graphs , the function was studied systematically in Axenovich et al. In this paper, we study the asymptotic behavior of this function for complete bipartite graphs that are not necessarily balanced. Our main results deal with thresholds and lower and upper bounds for the growth rate of this function, in particular for (sub)linear and (sub)quadratic growth. We also obtain new lower bounds for the balanced bipartite case, and improve several results given by Axenovich, Füredi and Mubayi. Our proof techniques are based on an extension to bipartite graphs of the recently developed Color Energy Method by Pohoata and Sheffer and its refinements, and a generalization of an old result due to Corrádi.