The board / graph theory / #761
Erdős Problem #761
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, chromatic number
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/761
Attempts
submit one →Read our working report →
The general problem remains open, but the two live questions are rigorously equivalent, and an independently checked exhaustive computation classifies every graph through seven vertices: exactly \(K_7
PARTIAL