Randomly generated intersecting hypergraphs II
From MaRDI portal
Abstract: Let be a positive constant. Suppose that and the members of are chosen sequentially at random to form an intersecting hypergraph . We show that whp consists of a simple hypergraph of size , a distinguished vertex and all -sets which contain and meet every edge of . This is a continuation of the study of such random intersecting systems started in [Electron. J. Combin, (2003) R29] where the case was considered. To obtain the stated result we continue to investigate this question in the range .
Recommendations
Cited in
(5)
This page was built for publication: Randomly generated intersecting hypergraphs II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3419609)