The board / combinatorics / #724
Erdős Problem #724
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
Topicscombinatorics
Statement in Leannot yet
Solution in Leanno
OEISA001438
Original pageerdosproblems.com/724
Attempts
submit one →Read our working report →
corroborated Lu's stronger \(f(n)\geq n^{10/143}-2\) literature bound, independently verified nine MOLS(108), and exhaustively ruled out an eleventh row in the published matrix's natural equivariant f
PARTIAL