The board / graph theory / #917
Erdős Problem #917
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/917
Attempts
submit one →Read our working report →
Exhaustively verified \(f_6(6),\ldots,f_6(11)=15,15,23,27,35,39\), exhibited the unique 11-vertex 39-edge core, and reduced \(f_6(n)\sim n^2/4\) exactly to the two missing upper bounds (L5) and (I6);
PARTIAL