Thresholds for (n,q,2)-Steiner Systems via Refined Absorption
Abstract
We prove that if p ≥ n-(q-6)/2, then asymptotically almost surely the binomial random q-uniform hypergraph G(q)(n,p) contains an (n,q,2)-Steiner system, provided n satisfies the necessary divisibility conditions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.