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

Abstract

AbstractGiven positive integers and , a ‐coloring of the complete graph is an edge‐coloring in which every ‐clique receives at least colors. Erdős and Shelah posed the question of determining , the minimum number of colors needed for a ‐coloring of . In this paper, we expand on the color energy technique introduced by Pohoata and Sheffer to prove new lower bounds on this function, making explicit the connection between bounds on extremal numbers and . Using results on the extremal numbers of subdivided complete graphs, theta graphs, and subdivided complete bipartite graphs, we generalize results of Fish, Pohoata, and Sheffer, giving the first nontrivial lower bounds on for some pairs and improving previous lower bounds for other pairs.