Randomly generated intersecting hypergraphs II

From MaRDI portal
(Redirected from Publication:3419609)



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












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)