A hypergraph version of a graph packing theorem by Bollobás and Eldridge
From MaRDI portal
Publication:2853340
DOI10.1002/JGT.21706zbMATH Open1273.05176OpenAlexW2123213912MaRDI QIDQ2853340FDOQ2853340
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
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
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Packings of graphs and applications to computational complexity
- Subgraphs of graphs. I
- Edge disjoint placement of graphs
- Packing of graphs - a survey
- Title not available (Why is that?)
- On packing of two copies of a hypergraph
- A note on packing of two copies of a hypergraph
- Packing two graphs of order n having total size at most 2n-2
- Packing of nonuniform hypergrahs- product and sum of sizes conditions
Cited In (5)
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)
