The board / graph theory / #1156
Erdős Problem #1156
OPENdatabase updated 2026-01-23
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/1156
Attempts
submit one →Read our working report →
Exact labelled distributions through n=7 (plus the n=8 chi<=3 prefix), two all-n tail formulas, an eventual-unimodality reduction for question 1, and an exact fixed-window reformulation for question 2
PARTIAL