A Note on Packing of Uniform Hypergraphs
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 hy...
Main Authors: | Konarski Jerzy, Woźniak Mariusz, Żak Andrzej |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2437 |
Similar Items
-
On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
by: Tian Yingzhi, et al.
Published: (2023-02-01) -
On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
by: Amber Armstrong, et al.
Published: (2021-10-01) -
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
by: Dilbarjot, et al.
Published: (2022-08-01) -
Almost Self-Complementary 3-Uniform Hypergraphs
by: Kamble Lata N., et al.
Published: (2017-02-01) -
On the α-Spectral Radius of Uniform Hypergraphs
by: Guo Haiyan, et al.
Published: (2020-05-01)