A counterexample to Stein's Equi-n-square Conjecture
Alexey Pokrovskiy, Benny Sudakov

TL;DR
This paper disproves Stein's Equi-n-square Conjecture by constructing arrays that lack large partial transversals, showing the conjecture does not hold universally.
Contribution
It provides a counterexample to Stein's conjecture, demonstrating that the conjecture is false for sufficiently large arrays.
Findings
Counterexamples exist for large arrays without partial transversals of size n - (1/42) ln n
Stein's Equi-n-square Conjecture is false in general
Constructs arrays with no large partial transversals
Abstract
In 1975 Stein conjectured that in every array filled with the numbers with every number occuring exactly times, there is a partial transversal of size . In this note we show that this conjecture is false by constructing such arrays without partial transverals of size .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
