I have the following question:
Suppose that in a simple undirected graph with $4n$ vertices, each vertex has degree at least $2n$.
Is it true that we can always partition the set of vertices in $n$ parts of size $4$ such that the vertices of every part can form a cycle (of length $4$)?
I was able to prove only that it is possible to find $4$ vertices that form a cycle.
