erdős #1015
Let be minimal such that, in any two-colouring of the edges of , the edges can be partitioned into vertex disjoint monochromatic copies of (not necessarily the same colour) with at most vertices remaining.Estimate . In particular, is it true that ? Is it true that ?
Worked, still open.
graph theory · solved · possible · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems