Erdős Problem #577

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

graph theory

A conjecture of Erdős and Faudree. Proved by Wang [Wa10].

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)

Likes this problem	None
Interested in collaborating	None
Currently working on this problem	None
This problem looks difficult	None
This problem looks tractable	None

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #577, https://www.erdosproblems.com/577, accessed 2026-01-14