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

Xihe Li, Hajo Broersma, Ligong Wang

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.…