Let $f (n)$ be the smallest number of colours required to colour the edges of $K_{n}$ such that every $K_{4}$ contains at least 5 colours. Determine the size of $f (n)$ .

Worked, still open.

graph theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved