Growth rates of the bipartite Erdos-Gy\'arf\'as function
Abstract
Given two graphs G, H and a positive integer q, an (H,q)-coloring of G is an edge-coloring of G such that every copy of H in G receives at least q distinct colors. The bipartite Erdos-Gy\'arf\'as function r(Kn,n, Ks,t, q) is defined to be the minimum number of colors needed for Kn,n to have a (Ks,t, q)-coloring. For balanced complete bipartite graphs Kp,p, the function r(Kn,n, Kp,p, q) was studied systematically in [Axenovich, F\"uredi and Mubayi, J. Combin. Theory Ser. B 79 (2000), 66--86]. In this paper, we study the asymptotic behavior of this function for complete bipartite graphs Ks,t 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\"uredi 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\'adi.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.