Subsquares in random Latin squares and rectangles

Alexander Divoux, Tom Kelly, Camille Kennedy +1

A $k\times n$ partial Latin rectangle is \textit{$C$-sparse} if the number of nonempty entries in each row and column is at most $C$ and each symbol is used at most $C$ times. We…