On the threshold problem for Latin boxes

DOI10.1002/rsa.20855zbMath1439.05040arXiv1711.09741OpenAlexW2963507266WikidataQ127950584 ScholiaQ127950584MaRDI QIDQ5216183

Zur Luria, Michael Simkin

Publication date: 14 February 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.09741

zbMATH Keywords

Latin squaresthreshold functionsgraph colorings

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The \(n\)-queens completion problem ⋮ Perfect matchings in random subgraphs of regular bipartite graphs ⋮ Computing tighter bounds on the \(n\)-queens constant via Newton's method ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

Cites Work

• Coloring complete and complete bipartite graphs from random lists
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• The solution of van der Waerden's problem for permanents
• Perfect matchings in \(\varepsilon\)-regular graphs
• Random triangle removal
• Two-dimensional weight-constrained codes through enumeration bounds
• Intercalates and discrepancy in random Latin squares
• Avoiding Arrays of Odd Order by Latin Squares
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the threshold problem for Latin boxes