Thresholds for $(n,q,2)$-Steiner Systems via Refined Absorption
Combinatorics
2024-02-29 v1
Abstract
We prove that if , then asymptotically almost surely the binomial random -uniform hypergraph contains an -Steiner system, provided 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