Tags
Prizes
More
FAQ
Problem Lists
Definitions
Links
How to help
Go
Go
All
Random Solved
Random Open
SOLVED
If $G$ is a graph with $4k$ vertices and minimum degree at least $2k$ then $G$ contains $k$ vertex-disjoint $4$-cycles.
#577
:
[Er90c]
graph theory
A conjecture of Erdős and Faudree. Proved by Wang
[Wa10]
.
Previous
Next
