The size of the giant component in random hypergraphs: a short proof

Oliver Cooley, Mihyun Kang, Christoph Koch

We consider connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\ge 2$ and $1\le j\le k-1$, two $j$-sets (of vertices) lie…