@article{CKLM22quasirandomLatinsquares,
title={Quasirandom Latin squares},
author={Cooper, Jacob W and Kr{\'a}{\v{l}}, Daniel and Lamaison, Ander and Mohr, Samuel},
note = {to appear. },
year = {2021},
journal = {Random Structures and Algorithms},
archivePrefix = {arXiv},
eprint={2011.07572},
biburl = {http://samuel-mohr.de/files/bib/17.bib},
abstract = {We prove a conjecture by Garbe et al. \href{https://arxiv.org/abs/2010.07854}{[arXiv:2010.07854]}
by showing that a Latin square is quasirandom if and only
if the density of every {$2\times 3$} pattern is {$1/720+o(1)$}.
This result is the best possible in the sense that
{$2\times 3$} cannot be replaced with {$2\times 2$} or {$1\times n$} for any {$n$}. }
}