On packing of two copies of a hypergraph

MaRDI QIDQ5403007zbMATH OpenFDO

Authors Monika Pilśniak, Mariusz Woźniak

Publication date 25 March 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1041/0.html

zbMATH Keywords

hypergraphspacking

Mathematics Subject Classification ID

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

Recommendations

• A note on packing of two copies of a hypergraph
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• Packing of nonuniform hypergrahs- product and sum of sizes conditions
• Packing of partial designs
• Hypergraph Packing and Graph Embedding

Cited in

(6)

• New results on degree sequences of uniform hypergraphs
• Packing a number of copies of a \(( p , q )\)-graph
• A note on packing of two copies of a hypergraph
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• A note on packing of uniform hypergraphs
• On the number of copies of one hypergraph in another

This page was built for publication: On packing of two copies of a hypergraph

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