The board / graph theory / #706
Erdős Problem #706
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/706
Attempts
submit one →Read our working report →
The polynomial upper bound remains open; this run gives explicit checked clique certificates including \(L(5)\ge12,L(7)\ge16,L(8)\ge19\), and proves by a standalone exhaustive checker that the triangu
PARTIAL