Pages that link to "Item:Q5216183"
From MaRDI portal
The following pages link to On the threshold problem for Latin boxes (Q5216183):
Displaying 7 items.
- The \(n\)-queens completion problem (Q2157925) (← links)
- Perfect matchings in random subgraphs of regular bipartite graphs (Q6055937) (← links)
- Computing tighter bounds on the \(n\)-queens constant via Newton's method (Q6097488) (← links)
- Large deviations in random latin squares (Q6133414) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
- Searching for (sharp) thresholds in random structures: where are we now? (Q6658193) (← links)
- Coloring hypergraphs from random lists (Q6671607) (← links)