Let $G$ be an $r$ -partite graph with $n$ vertices in each part. If $G$ has minimum degree $\geq (r - \frac{3}{2} - o (1)) n$ then $G$ must contain a $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