ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KknK_k^n be the complete kk-uniform hypergraph on nn vertices, and expose its edges one by one in a uniformly random order to obtain the random hypergraph process. A facet is a (k−1)(k-1)-subset of vertices, and a facet is covered when it is contained in at least one exposed edge. Steiner-system hitting-time conjecture. As n→∞n\to\infty with kk fixed, asymptotically almost surely a Steiner system appears at the very moment that all facets are covered. This would identify the sole obstruction to a Steiner system in the process with the presence of uncovered facets, extending the corresponding graph-process phenomenon; the analogous assertion for perfect matchings in hypergraphs is noted as open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.