Threshold for Steiner triple systems
From MaRDI portal
Publication:6173554
Abstract: We prove that with high probability contains a spanning Steiner triple system for , establishing the exponent for the threshold probability for existence of a Steiner triple system. We also prove the analogous theorem for Latin squares. Our result follows from a novel bootstrapping scheme that utilizes iterative absorption as well as the connection between thresholds and fractional expectation-thresholds established by Frankston, Kahn, Narayanan, and Park.
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 4215352 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 903456 (Why is no real title available?)
- scientific article; zbMATH DE number 3216216 (Why is no real title available?)
- A threshold for perfect matchings in random d-pure hypergraphs
- Are many small sets explicitly small?
- Asymptotic packing via a branching process
- Asymptotics for Shamir's problem
- Avoiding Arrays of Odd Order by Latin Squares
- Counting designs
- Edge-decompositions of graphs with high minimum degree
- Edge-disjoint Hamilton cycles in random graphs
- Factors in random graphs
- Fractional clique decompositions of dense partite graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamiltonian circuits in random graphs
- Hitting times for Shamir's problem
- Hunting for sharp thresholds
- Improved bounds for the sunflower lemma
- Large deviations in random latin squares
- Minimalist designs
- On Hamilton cycles in Erdős-Rényi subgraphs of large graphs
- On Pósa's conjecture for random graphs
- On a conjecture of Erdős on locally sparse Steiner triple systems
- On a packing and covering problem
- On the existence of a factor of degree one of a connected random graph
- Pseudorandom hypergraph matchings
- Robust Hamiltonicity of Dirac graphs
- Sharp thresholds of graph properties, and the $k$-sat problem
- Spanning trees in random graphs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- The Turán problem for projective geometries
- The probabilistic method
- The threshold for the square of a Hamilton cycle
- Threshold for Steiner triple systems
- Thresholds and Expectation Thresholds
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
- Thresholds versus fractional expectation-thresholds
- Two-Sided, Unbiased Version of Hall’s Marriage Theorem
Cited in
(8)- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
- Substructures in Latin squares
- Almost all Steiner triple systems have perfect matchings
- Threshold for Steiner triple systems
- Every Steiner triple system contains almost spanning \(d\)-ary hypertree
- An upper bound on the number of Steiner triple systems
- Searching for (sharp) thresholds in random structures: where are we now?
- Spreading linear triple systems and expander triple systems
This page was built for publication: Threshold for Steiner triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173554)
