History of Core thresholds of random $k$-uniform hypergraphs

 Title: Core thresholds of random $k$-uniform hypergraphs Definition: The $r$-core of a $k$-uniform hypergraph CITE{WikiHypergraph} is its largest-  subhypergraph in which every vertex has degree at least $r$. For $k\geq3$ and $r\geq2$,-  $c_{k,r}$ is the number such that a uniformly random $k$-uniform hypergraph on $n$-  vertices with $m=\lfloor cn\rfloor$ edges has, with probability tending to $1$ as-  $n\to\infty$, an empty $r$-core when $c<c_{k,r}$ and a nonempty $r$-core when $c>c_{k,r}$-  CITE{Molloy} CITE{CainWormald}.+  subhypergraph with every vertex of degree at least $r$. In the random model with+  $n$ vertices and $m=\lfloor cn\rfloor$ edges, $c_{k,r}$ is the high-probability+  threshold between empty and nonempty $r$-cores CITE{Molloy} CITE{CainWormald}. Keywords: peeling threshold, pure literal rule, invertible Bloom lookup table, 2-core Parameters: