The board / graph theory / #129
Erdős Problem #129
ambiguous statement
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, ramsey theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/129
Attempts
submit one →Read our working report →
Under the live page's literal definition, \(R(n;3,2)>\lfloor1.022^n\rfloor\) for every \(n\ge500\), and EKR strengthens this to \(R(n;3,2)\ge2^{(1/4-o(1))n}\); hence the requested \(C^{\sqrt n}\) uppe
PROVED