Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitlePacking random graphs and hypergraphs.AuthorsBollobás, Béla; Janson, Svante; Scott, AlexAbstractWe determine to within a constant factor the threshold for the property that two random k-uniform hypergraphs with edge probability p have an edge-disjoint packing into the same vertex set. More generally, we allow the hypergraphs to have different densities. In the graph case, we prove a stronger result, on packing a random graph with a fixed graph. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 3-13, 2017SubjectsHYPERGRAPHS; RANDOM graphs; PROBABILITY theory; GEOMETRIC vertices; RANDOM measuresPublicationRandom Structures & Algorithms, 2017, Vol 51, Issue 1, p3ISSN1042-9832Publication typeArticleDOI10.1002/rsa.20673