English

Growth rates of the bipartite Erd\H{o}s-Gy\'{a}rf\'{a}s function

Combinatorics 2024-07-15 v3

Abstract

Given two graphs G,HG, H and a positive integer qq, an (H,q)(H,q)-coloring of GG is an edge-coloring of GG such that every copy of HH in GG receives at least qq distinct colors. The bipartite Erd\H{o}s-Gy\'{a}rf\'{a}s function r(Kn,n,Ks,t,q)r(K_{n,n}, K_{s,t}, q) is defined to be the minimum number of colors needed for Kn,nK_{n,n} to have a (Ks,t,q)(K_{s,t}, q)-coloring. For balanced complete bipartite graphs Kp,pK_{p,p}, the function r(Kn,n,Kp,p,q)r(K_{n,n}, K_{p,p}, q) was studied systematically in [Axenovich, F\"{u}redi and Mubayi, {\it J. Combin. Theory Ser. B} {\bf 79} (2000), 66--86]. In this paper, we study the asymptotic behavior of this function for complete bipartite graphs Ks,tK_{s,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\"{u}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\'{a}di.

Keywords

Cite

@article{arxiv.2111.00879,
  title  = {Growth rates of the bipartite Erd\H{o}s-Gy\'{a}rf\'{a}s function},
  author = {Xihe Li and Hajo Broersma and Ligong Wang},
  journal= {arXiv preprint arXiv:2111.00879},
  year   = {2024}
}

Comments

34 pages, 1 figure