A hypergraph version of a graph packing theorem by Bollobás and Eldridge

DOI10.1002/JGT.21706MaRDI QIDQ2853340zbMATHOpenAlexFDO

Authors Christopher J. Stocker, Peter Hamburger, Alexandr Kostochka

Publication date 21 October 2013

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.21706

zbMATH Keywords

hypergraphgraph packing

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• A note on node packing polytopes on hypergraphs
• A note on packing of uniform hypergraphs
• Two theorems on packings of graphs
• scientific article; zbMATH DE number 15160
• Hypergraph packing and sparse bipartite Ramsey numbers
• A note on packing of two copies of a hypergraph
• Hypergraph Packing and Graph Embedding
• On packing of two copies of a hypergraph
• Packing random graphs and hypergraphs

Cites work

• scientific article; zbMATH DE number 1022391 (Why is no real title available?)
• A note on packing of two copies of a hypergraph
• Edge disjoint placement of graphs
• On packing of two copies of a hypergraph
• Packing of graphs - a survey
• Packing of nonuniform hypergrahs- product and sum of sizes conditions
• Packing two graphs of order n having total size at most 2n-2
• Packings of graphs and applications to computational complexity
• Subgraphs of graphs. I

Cited in

(5)

• A note on packing of uniform hypergraphs
• Hypergraph Packing and Graph Embedding
• New results on degree sequences of uniform hypergraphs
• A note on packing of two copies of a hypergraph
• On packing of two copies of a hypergraph

This page was built for publication: A hypergraph version of a graph packing theorem by Bollobás and Eldridge

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