Packing random graphs and hypergraphs

DOI10.1002/RSA.20673MaRDI QIDQ5360867zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Svante Janson, Alex Scott

Publication date 26 September 2017

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.6354

zbMATH Keywords

packingrandom hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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.

Recommendations

• Packing perfect matchings in random hypergraphs
• Perfect packings in quasirandom hypergraphs. I.
• Perfect Packings in Quasirandom Hypergraphs II
• scientific article; zbMATH DE number 903456
• Hypergraph Packing and Graph Embedding

Cited in

(19)

• Packing graphs of bounded codegree
• Disproof of a packing conjecture of Alon and Spencer
• Packing perfect matchings in random hypergraphs
• Packing trees of unbounded degrees in random graphs
• Perfect packings in quasirandom hypergraphs. I.
• scientific article; zbMATH DE number 5665909 (Why is no real title available?)
• Packing tree factors in random and pseudo-random graphs
• Perfect Packings in Quasirandom Hypergraphs II
• Connectivity of old and new models of friends-and-strangers graphs
• Packing the hypercube
• scientific article; zbMATH DE number 903456 (Why is no real title available?)
• Integer and fractional packings of hypergraphs
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• Random packing by -connected -regular graphs
• Graphs that are randomly packable by some common disconnected graphs
• scientific article; zbMATH DE number 851072 (Why is no real title available?)
• On the diameters of friends-and-strangers graphs
• Hypergraph Packing and Graph Embedding
• Packing of nonuniform hypergrahs- product and sum of sizes conditions

This page was built for publication: Packing random graphs and hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360867)