Erdős Problem #747 — Perfect matchings in random three-uniform hypergraphs
How large must be so that a uniformly random -uniform hypergraph with vertices and edges contains pairwise vertex-disjoint edges with probability tending to one?
References
Primary source
Additional references
P. Erdős, On the combinatorial problems which I would most like to see solved, Combinatorica 1 (1981), 25–42.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.