Subsquares in random Latin squares

We prove that with probability \(1-o(1)\) as \(n \to \infty\), a uniformly random Latin square of order \(n\) contains no subsquare of order \(4\) or more, resolving a conjecture of McKay and Wanless. We also show that the expected number of subsquares of order 3 is bounded.