Threshold for Steiner triple systems
From MaRDI portal
Publication:6173554
DOI10.1007/s00039-023-00639-6zbMath1518.05021arXiv2204.03964OpenAlexW4381164947MaRDI QIDQ6173554
Michael Simkin, Mehtaab Sawhney, Ashwin Sah
Publication date: 21 July 2023
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.03964
Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05) Triple systems (05B07)
Related Items
Substructures in Latin squares, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, Threshold for Steiner triple systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a packing and covering problem
- Hamiltonian circuits in random graphs
- Counting designs
- A threshold for perfect matchings in random d-pure hypergraphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Thresholds versus fractional expectation-thresholds
- Improved bounds for the sunflower lemma
- On a conjecture of Erdős on locally sparse Steiner triple systems
- Spanning trees in random graphs
- The Turán problem for projective geometries
- Asymptotics for Shamir's problem
- Are many small sets explicitly small?
- Thresholds and Expectation Thresholds
- Factors in random graphs
- Sharp thresholds of graph properties, and the $k$-sat problem
- Two-Sided, Unbiased Version of Hall’s Marriage Theorem
- Hunting for sharp thresholds
- Asymptotic packing via a branching process
- On Pósa's Conjecture for Random Graphs
- Avoiding Arrays of Odd Order by Latin Squares
- The threshold for the square of a Hamilton cycle
- Pseudorandom hypergraph matchings
- Hitting times for Shamir’s problem
- Minimalist designs
- On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs
- Edge-disjoint Hamilton cycles in random graphs
- Fractional Clique Decompositions of Dense Partite Graphs
- Robust Hamiltonicity of Dirac graphs
- On the existence of a factor of degree one of a connected random graph
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Edge-decompositions of graphs with high minimum degree
- Large deviations in random latin squares
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
- Threshold for Steiner triple systems
