A $(5,5)$-coloring of $K_n$ with few colors

Abstract

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. We construct an explicit $(5,5)$-coloring that shows that $f(n,5,5)\le n^{1/3+o(1)}$ as $n\to \infty$. This improves upon the best known probabilistic upper bound of $O\left(n^{1/2}\right)$ given by Erdős and Gyárfás, and comes close to matching the best known lower bound $\Omega \left(n^{1/3}\right)$.

20 pages, 4 figures