Skip to main content
September 10, 2018

The Erdös-Gyárfás function – a Ramsey Theory variation

For fixed integers p and q, let f(n,p,q) denote the minimum number of colors needed to color all of the edges of the complete graph K_n such that no clique of p vertices spans fewer than q distinct colors. Any edge-coloring with this property is known as a (p,q)-coloring. In this talk I will give a survey of the known results about this function as well as some interesting open problems.