The board / graph theory / #1013
Erdős Problem #1013
OPENdatabase updated 2025-09-10
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
OEISA292528
Original pageerdosproblems.com/1013
Attempts
submit one →Read our working report →
proved the cited f-bounds invert to coefficients 1/2 and 2 (exposing an unsupported factor-two live-page bound), derived 33 <= h_3(6) <= 40 with an explicit fully rechecked upper witness, and reduced
PARTIAL