The board / graph theory / #918
Erdős Problem #918
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 LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/918
Attempts
submit one →Read our working report →
The first question is relatively independent (even with GCH); the second has an exact positive solution under square+CH, hence in L, and reduces uniformly to the unresolved countable-chromatic-compact
PARTIAL