Subsquares in Random Latin Squares and Rectangles
ABSTRACT A partial Latin rectangle is if the number of nonempty entries in each row and column is at most and each symbol is used at most times. We prove that the probability a uniformly random Latin rectangle, where , contains a ‐sparse partial Latin rectangle with nonempty entries is for sufficiently large and sufficiently small . Using this result, we prove that a uniformly random order‐ Latin square asymptotically almost surely has no Latin subsquare of order greater than for an absolute constant .
Authors
- Tom Kelly (ORCID: https://orcid.org/0000-0002-4040-1648)
- Alexander Divoux
- Jasdeep Sidhu
- Camille Kennedy
Institutions
- Northwestern University (US)
- Georgia Institute of Technology (US)
- Stanford University (US)
Publication Details
- Journal
- Journal of Combinatorial Designs
- Published
- 2025-12-18
- DOI
- https://doi.org/10.1002/jcd.70004
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- College of Computing