Year: 2026
Type: preprint
Abstract: For all sufficiently large $n$, we prove that every Latin square of order $n$ can be made to avoid any prescribed partial Latin square of order $n$ by permuting only its rows and columns. The proof combines Hall's theorem with elementary estimates for a random permutation.
Source: arXiv (Cornell University)
Authors: Cambie, Stijn, Wanless, Ian M.
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7222233361