On randomly generated intersecting hypergraphs (Q1408534)

Summary: Let \(c\) be a positive constant. We show that if \(r=\lfloor cn^{1/3}\rfloor\) and the members of \(\left ( \begin{smallmatrix} [n] \\ r \end{smallmatrix}\right)\) are chosen sequentially at random to form an intersecting hypergraph then with limiting probability \((1+c^3)^{-1}\), as \(n \rightarrow \infty\), the resulting family will be of maximum size \(\left ( \begin{smallmatrix} n-1\\ r-1\end{smallmatrix}\right)\).