The board / graph theory / #911
Erdős Problem #911
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/911
Attempts
submit one →Read our working report →
Erdős #911 is exactly reduced, up to explicit constants, to proving \(\beta(d)=\omega(d)\) for bipartite minimum-degree-\(d\) targets; projective-plane incidence graphs certify that biclique extractio
PARTIAL