Lower bounds on the Erdős-Gyárfás problem via color energy graphs

József Balogh, Sean English, Emily Heath +1

Given positive integers $p$ and $q$, a $(p,q)$-coloring of the complete graph $K_n$ is an edge-coloring in which every $p$-clique receives at least $q$ colors. Erdős and Shelah pos…