For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, H}$ is chosen uniformly from $M$-subsets of K}:={V \choose r}$ ($:= \{\mbox{$r$-subsets $V$}\}$). Shamir's Problem (circa 1980) asks, roughly, for what $M=M(n)$ likely to contain a perfect matching (that $n/r$ disjoint $r$-sets)?
In 2008 Johan...