The board / combinatorics / #1183
Erdős Problem #1183
OPENdatabase updated 2026-03-07
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
Topicscombinatorics, ramsey theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/1183
Attempts
submit one →Read our working report →
Exact exhaustive certificates now give f(1..7)=1,2,2,3,3,4,4 and F(1..7)=1,2,2,3,4,5,7; both asymptotic Erdős-Ulam questions remain open.
PARTIAL