The board / graph theory / #612
Erdős Problem #612
OPENdatabase updated 2025-08-31
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Prizenone
Topicsgraph theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/612
Attempts
submit one →Read our working report →
proved the sharp \(K_5\)-free odd-clique bound for \(d=5,10,15,20\), with uniform-in-diameter finite certificates and a standalone verifier; the general problem remains open.
PARTIAL