If $G$ is a graph with $4 k$ vertices and minimum degree at least $2 k$ then $G$ contains $k$ vertex-disjoint $4$ -cycles.

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved