Largest Components in Random Hypergraphs
In this paper we considerj-tuple-connected components in randomk-uniform hypergraphs (thej-tuple-connectedness relation can be defined by letting twoj-sets be connected if they lie in a common edge and considering the transitive closure; the casej= 1 corresponds to the common notion of vertex-connectedness). We show that the existence of aj-tuple-connected component containing Θ(nj)j-sets undergoes a phase transition and show that the threshold occurs at edge probability$$\frac{(k-j)!}{\binom{k}{j}-1}n^{j-k}.$$Our proof extends the recent short proof for the graph case by Krivelevich and Sudakov, which makes use of a depth-first search to reveal the edges of a random graph.Our main original contribution is abounded degree lemma, which controls the structure of the component grown in the search process.