Let $k \geq 2$ and $l \geq 3$ . Is there a graph $G$ which contains no $K_{l + 1}$ such that every $k$ -colouring of the edges of $G$ contains a monochromatic copy of $K_{l}$ ?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved