The board / graph theory / #601
Erdős Problem #601
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).
Prize$500
Topicsgraph theory, set theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/601
Attempts
submit one →Read our working report →
Every rayless instance reduces rigorously to a full-type finite-kernel column graph with a ccc finite-independent-set poset; the remaining CH-frontier obstruction is the full-order kernel avoidance pl
PARTIAL