The board / graph theory / #111
Erdős Problem #111
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, set theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/111
Attempts
submit one →Read our working report →
The universal limit is equivalent to Erdős's finite-density formulation, and the EHS ordered 2-shift is proved to have sharp \(\Theta(n^{3/2})\) defect; exact DP gives \(\beta(S_{12})=40\).
PARTIAL