Let $r \geq 2$ and $m \geq 1$ . Every graph with $r m$ vertices and minimum degree at least $m (r - 1)$ contains $m$ vertex disjoint copies of $K_{r}$ .

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved