Name
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 |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1002/rsa.20673 | Random Struct. Algorithms |
Keywords | DocType | Volume |
packing,random hypergraphs | Journal | 51 |
Issue | ISSN | Citations |
1 | 1042-9832 | 4 |
PageRank | References | Authors |
0.47 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bela Bollobas | 1 | 66 | 12.05 |
| Svante Janson | 2 | 1009 | 149.67 |
| Alex Scott | 3 | 251 | 40.93 |