A note on packing of uniform hypergraphs

DOI10.7151/DMGT.2437zbMATH Open1493.05248OpenAlexW3215773774MaRDI QIDQ2158207FDOQ2158207

Authors Jerzy Konarski, Mariusz Woźniak, Andrzej Żak 

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

hypergraphspacking

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)

Abstract: A packing of two $k$-uniform hypergraphs $H_1$ and $H_2$ is a set ${H_1}^{\prime },{H_2}^{\prime }$ of edge-disjoint sub-hypergraphs of the complete $k$-uniform hypergraph $K_n^{(k)}$ such that ${H_1}^{\prime }cong{H}_1$ and ${H_2}^{\prime }cong{H}_2$. Whilst the problem of packing of graphs (i.e. 2-uniform hypergraphs) has been studied extensively since seventies with many sharp results, much less is known about packing of general hypergraphs. In this paper we attempt to find the minimum possible sum of sizes $m(n,k)$ of two $k$-uniform, $n$-vertex hypergaphs which do not pack. We also prove a sufficient condition on the product of maximum degrees, which guarantees the packing.

Recommendations

• Packing \(k\)-partite \(k\)-uniform hypergraphs
• Packing \(k\)-partite \(k\)-uniform hypergraphs
• A note on packing of two copies of a hypergraph
• Packing of nonuniform hypergrahs- product and sum of sizes conditions
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge

Cites Work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• A note on packing of two copies of a hypergraph
• Edge disjoint placement of graphs
• On packing of two copies of a hypergraph
• Packing of nonuniform hypergrahs- product and sum of sizes conditions
• Packings of graphs and applications to computational complexity
• The General Chinese Remainder Theorem

Cited In (7)

• A note on packing of two copies of a hypergraph
• Integer and fractional packings in dense 3‐uniform hypergraphs
• Perfect packings in quasirandom hypergraphs. I.
• Perfect Packings in Quasirandom Hypergraphs II
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• Integer and fractional packings of hypergraphs
• Packing of nonuniform hypergrahs- product and sum of sizes conditions

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

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