On Randomly Generated Intersecting Hypergraphs

@article{Bohman2003OnRG,
  title={On Randomly Generated Intersecting Hypergraphs},
  author={Tom Bohman and Colin S Cooper and Alan M. Frieze and Ryan R. Martin and Mikl{\'o}s Ruszink{\'o}},
  journal={Electr. J. Comb.},
  year={2003},
  volume={10}
}
Let c be a positive constant. We show that if r = bcn1/3c and the members of ( [n] r ) are chosen sequentially at random to form an intersecting hypergraph then with limiting probability (1 + c3)−1, as n→∞, the resulting family will be of maximum size ( n−1 r−1 ) . 

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Probabilities for intersecting systems and random subsets of finite sets

  • P. C. Fishburn, P. Frankl, D. Freed, J. C. Lagarias, A. M. Odlyzko
  • SIAM J. Algebraic Discrete Methods, 7
  • 1986
Highly Influential
3 Excerpts

On random susbsets of a finite set

  • A. Rényi
  • Mathematica (Cluj) 3 (), pp. 355-362. the…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…