Subsquares in random Latin squares and rectangles

DOI10.1002/JCD.70004MaRDI QIDQ6845755zbMATH OpenFDO

Authors Alexander Divoux, Tom Kelly, Camille Kennedy, Jasdeep Sidhu

Publication date 12 March 2026

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JCD.70004

zbMATH Keywords

uniformly random \(k\times n\) Latin rectangle

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Orthogonal arrays, Latin squares, Room squares (05B15)

Cites work

• A proof of the Kahn–Kalai conjecture
• Asymptotic enumeration of Latin rectangles
• Canonical labeling of Latin squares in average-case polynomial time
• Fractional cycle decompositions in hypergraphs
• Fractional triangle decompositions of dense 3-partite graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Intercalates and discrepancy in random Latin squares
• Large deviations in random latin squares
• Most Latin squares have many subsquares
• Random perfect matchings in regular graphs
• Subsquares in random Latin rectangles
• Substructures in Latin squares
• The cycle structure of two rows in a random Latin square
• Threshold for Steiner triple systems
• Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

This page was built for publication: Subsquares in random Latin squares and rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845755)