The board / graph theory / #62
Erdős Problem #62
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
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/62
Attempts
submit one →Read our working report →
Proved the common-4-chromatic conclusion for every pair of canonical finite-order shift-graph ages and computed exact first thresholds 4, 9, 21, 85, 8574 through order five; the arbitrary good-family
PARTIAL