Packing random graphs and hypergraphs
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 r...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Wiley
2016
|
| _version_ | 1797081760599638016 |
|---|---|
| author | Bollobas, B Janson, S Scott, A |
| author_facet | Bollobas, B Janson, S Scott, A |
| author_sort | Bollobas, B |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-07T01:18:33Z |
| format | Journal article |
| id | oxford-uuid:8f87ba81-cb1a-43bb-bff6-d00132932ae0 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T01:18:33Z |
| publishDate | 2016 |
| publisher | Wiley |
| record_format | dspace |
| spelling | oxford-uuid:8f87ba81-cb1a-43bb-bff6-d00132932ae02022-03-26T23:05:12ZPacking random graphs and hypergraphsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:8f87ba81-cb1a-43bb-bff6-d00132932ae0Symplectic Elements at OxfordWiley2016Bollobas, BJanson, SScott, AWe 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. |
| spellingShingle | Bollobas, B Janson, S Scott, A Packing random graphs and hypergraphs |
| title | Packing random graphs and hypergraphs |
| title_full | Packing random graphs and hypergraphs |
| title_fullStr | Packing random graphs and hypergraphs |
| title_full_unstemmed | Packing random graphs and hypergraphs |
| title_short | Packing random graphs and hypergraphs |
| title_sort | packing random graphs and hypergraphs |
| work_keys_str_mv | AT bollobasb packingrandomgraphsandhypergraphs AT jansons packingrandomgraphsandhypergraphs AT scotta packingrandomgraphsandhypergraphs |