Szczegóły publikacji
Opis bibliograficzny
A note on packing of uniform hypergraphs / Jerzy KONARSKI, Mariusz WOŹNIAK, Andrzej ŻAK // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2022 — vol. 42 no. 4, s. 1383-1388. — Bibliogr. s. 1387–1388, Abstr. — Publikacja dostępna online od: 2021-11-12
Autorzy (3)
Słowa kluczowe
Dane bibliometryczne
ID BaDAP | 141275 |
---|---|
Data dodania do BaDAP | 2022-07-29 |
Tekst źródłowy | URL |
DOI | 10.7151/dmgt.2437 |
Rok publikacji | 2022 |
Typ publikacji | artykuł w czasopiśmie |
Otwarty dostęp | |
Creative Commons | |
Czasopismo/seria | Discussiones Mathematicae, Graph Theory |
Abstract
We say that two n-vertex hypergraphs H-1 and H-2 pack if they can be found as edge-disjoint subhypergraphs of the complete hypergraph K-n. 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 m(k)(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 m(k)(n) = Theta (n(k-1)). In this note we show that this conjecture is far from being truth. Namely, we prove that the growth rate of m(k)(n) is of order n(k/2) exactly for even k's and asymptotically for odd k's.