For fixed
and
, an edge‐coloring of the complete graph
is said to be a
‐coloring if every
receives at least
distinct colors. The function
is the minimum number of colors needed for
to have a
‐coloring. This function was introduced about 45 years ago, but was studied systematically...