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)$ .

unreviewedOpen. Worked here; no verified result yet.

graph theory · solved · possible · 0 attempts

use this data

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

Connections1

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Search Vela