The board / graph theory / #1182
Erdős Problem #1182
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
Topicsgraph theory, ramsey theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/1182
Attempts
submit one →Read our working report →
Verified F(7)=11 and f(7)=16 by a fresh exhaustive checker, recovered the published table through n=12, and sharpened the live-page existential bound to n^(3/2)sqrt(log n) << f(n) << n^(3/2)log n via
PARTIAL