Restricted completion of sparse partial Latin squares

Lina J. Andrén, Carl Johan Casselgren, Klas Markström

An $n\times n$ partial Latin square $P$ is called $\alpha$-dense if each row and column has at most $\alpha n$ non-empty cells and each symbol occurs at most $\alpha n$ times in $P$. An $n \times…