A Note on Packing of Uniform Hypergraphs
Discussiones Mathematicae. Graph Theory, Tome 42 (2022) no. 4, pp. 1383-1388
Voir la notice de l'article provenant de la source Library of Science
We say that two n-vertex hypergraphs H1 and H2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph Kn. Whilst the problem of packing of graphs (i.e., 2-uniform hypergraphs) has been studied extensively since seventies, much less is known about packing of k-uniform hypergraphs for k ≥ 3. Naroski [Packing of nonuniform hypergraphs - product and sum of sizes conditions, Discuss. Math. Graph Theory 29 (2009) 651–656] defined the parameter mk(n) to be the smallest number m such that there exist two n-vertex k-uniform hypergraphs with total number of edges equal to m which do not pack, and conjectured that mk(n) = Θ (nk−1). In this note we show that this conjecture is far from being truth. Namely, we prove that the growth rate of mk(n) is of order nk/2 exactly for even k’s and asymptotically for odd k’s.
Keywords:
packing, hypergraphs
@article{DMGT_2022_42_4_a19,
author = {Konarski, Jerzy and Wo\'zniak, Mariusz and \.Zak, Andrzej},
title = {A {Note} on {Packing} of {Uniform} {Hypergraphs}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {1383--1388},
publisher = {mathdoc},
volume = {42},
number = {4},
year = {2022},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2022_42_4_a19/}
}
TY - JOUR AU - Konarski, Jerzy AU - Woźniak, Mariusz AU - Żak, Andrzej TI - A Note on Packing of Uniform Hypergraphs JO - Discussiones Mathematicae. Graph Theory PY - 2022 SP - 1383 EP - 1388 VL - 42 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2022_42_4_a19/ LA - en ID - DMGT_2022_42_4_a19 ER -
Konarski, Jerzy; Woźniak, Mariusz; Żak, Andrzej. A Note on Packing of Uniform Hypergraphs. Discussiones Mathematicae. Graph Theory, Tome 42 (2022) no. 4, pp. 1383-1388. http://geodesic.mathdoc.fr/item/DMGT_2022_42_4_a19/