A note on packing of uniform hypergraphs

DOI10.7151/DMGT.2437zbMath1493.05248arXiv1802.05051OpenAlexW3215773774MaRDI QIDQ2158207

Andrzej Żak, Mariusz Woźniak, Jerzy Konarski

Publication date: 26 July 2022

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

Full work available at URL: https://arxiv.org/abs/1802.05051

zbMATH Keywords

packinghypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
• Packing of nonuniform hypergrahs- product and sum of sizes conditions
• A note on packing of two copies of a hypergraph
• The General Chinese Remainder Theorem

This page was built for publication: A note on packing of uniform hypergraphs