Randomly generated intersecting hypergraphs II

Let $c$ be a positive constant. Suppose that $r=o(n^{5/12})$ and the members of $\binom{[n]}{r}$ are chosen sequentially at random to form an intersecting hypergraph $\mathcal{H}$. We show that whp $\mathcal{H}$ consists of a simple hypergraph $\mathcal{S}$ of size $\Theta(r/n^{1/3})$, a distinguished vertex $v$ and all $r$-sets which contain $v$ and meet every edge of $\mathcal{S}$. This is a continuation of the study of such random intersecting systems started in [Electron. J. Combin, (2003) R29] where the case $r=O(n^{1/3})$ was considered. To obtain the stated result we continue to investigate this question in the range $\omega(n^{1/3})\le r \le o(n^{5/12})$.

[1]  Zoltán Füredi,et al.  Beyond the Erdös-Ko-Rado theorem , 1991, J. Comb. Theory, Ser. A.

[2]  Rudolf Ahlswede,et al.  The Complete Intersection Theorem for Systems of Finite Sets , 1997, Eur. J. Comb..

[3]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[4]  Peter Winkler,et al.  On the Size of a Random Maximal Graph , 1995, Random Struct. Algorithms.

[5]  Jeffrey C. Lagarias,et al.  Probabilities for intersecting systems and random subsets of finite sets , 1986 .

[6]  Béla Bollobás,et al.  Random Graphs , 1985 .

[7]  Alan M. Frieze,et al.  On Randomly Generated Intersecting Hypergraphs , 2003, Electron. J. Comb..

[8]  Alan M. Frieze,et al.  G-Intersecting Families , 2001, Comb. Probab. Comput..

[9]  P. Erdös,et al.  INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .

[10]  alcun K. grafo.  ASYMPTOTIC ENUMERATION OF Kn-FREE GRAPHS , 2004 .