A note on packing of two copies of a hypergraph

DOI10.7151/DMGT.1343MaRDI QIDQ5444055zbMATH OpenOpenAlexFDO

Authors Monika Pilśniak, Mariusz Woźniak

Publication date 22 February 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3fdfe541c55d1183bff6c3e4a26e48238cd64bea

Mathematics Subject Classification ID

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

Recommendations

• On packing of two copies of a hypergraph
• A note on packing of uniform hypergraphs
• Two theorems on packings of graphs
• On Two Conjectures on Packing of Graphs
• A note on node packing polytopes on hypergraphs
• Packing a number of copies of a \(( p , q )\)-graph
• A note on packing two copies of a tree into a graph with small maximum degree
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• Note on compact packing of a graph
• A note on careful packing of a graph

Cited in

(7)

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

This page was built for publication: A note 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 Q5444055)