Packing random graphs and hypergraphs. Issue 1 (1st November 2016)

• Record Type: Journal Article
• Authors: Bollobás, Béla; Janson, Svante; Scott, Alex
• Is Part Of: Random structures & algorithms. Volume 51:Issue 1(2017)
• Page Start: 3
• Page End: 13
• Publication Date: 2016-11-01
• Subjects: packing -- random hypergraphs; Random graphs -- Periodicals; Mathematical analysis -- Periodicals; 519
• DOI: 10.1002/rsa.20673
• Languages: English
• ISSNs: 1042-9832

Abstract

Abstract : We 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, 2017