How large should $ℓ (n)$ be such that, almost surely, a random $3$ -uniform hypergraph on $3 n$ vertices with $ℓ (n)$ edges must contain $n$ vertex-disjoint edges?

Worked, still open.

combinatorics · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved