The board / graph theory / #577
Erdős Problem #577
PROVEDdatabase updated 2025-08-31
The statement as posed is true, and a proof exists.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
If \(G\) is a graph with \(4k\) vertices and minimum degree at least \(2k\) then \(G\) contains \(k\) vertex-disjoint \(4\)-cycles. A conjecture of Erdős and Faudree. Proved by Wang [Wa10].
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/577.Prizenone
Topicsgraph theory
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/577
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.