A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
From MaRDI portal
Publication:2853340
DOI10.1002/jgt.21706zbMath1273.05176MaRDI QIDQ2853340
Christopher Stocker, Peter Hamburger, Alexandr V. 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
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Edge disjoint placement of graphs
- Packing two graphs of order n having total size at most 2n-2
- Packings of graphs and applications to computational complexity
- Packing of graphs - a survey
- Subgraphs of graphs. I
- Packing of nonuniform hypergrahs- product and sum of sizes conditions
- A note on packing of two copies of a hypergraph