English

Thresholds for $(n,q,2)$-Steiner Systems via Refined Absorption

Combinatorics 2024-02-29 v1

Abstract

We prove that if pn(q6)/2p \geq n^{-(q-6)/2}, then asymptotically almost surely the binomial random qq-uniform hypergraph G(q)(n,p)G^{(q)}(n,p) contains an (n,q,2)(n,q,2)-Steiner system, provided nn satisfies the necessary divisibility conditions.

Keywords

Cite

@article{arxiv.2402.17858,
  title  = {Thresholds for $(n,q,2)$-Steiner Systems via Refined Absorption},
  author = {Michelle Delcourt and Tom Kelly and Luke Postle},
  journal= {arXiv preprint arXiv:2402.17858},
  year   = {2024}
}

Comments

17 pages

R2 v1 2026-06-28T15:02:31.502Z