ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be an n×nn\times n array filled with the symbols 1,…,n1,\dots,n, with each symbol occurring exactly nn times. A partial transversal is a collection of cells with no two in the same row, column, or symbol.

Stein's equi-nn-square conjecture. Every such array SS has a partial transversal of size n−1n-1.

The conjecture generalizes the corresponding question for Latin squares, since every symbol in an n×nn\times n Latin square occurs exactly nn times. It is false: the paper constructs equi-nn-squares without partial transversals of size n−142ln⁡nn-\frac{1}{42}\ln n.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.