Is it true that, in any two-colouring of the edges of $K_{n}$ , there exist $n$ monochromatic paths, all of the same colour, which cover all vertices?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved