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

Alex Cameron, Emily Heath

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…