TY  - JOUR
ID  - Bunge2020
LB  - Bunge2020
AU  - Bunge, Ryan C.
AU  - Collins, Dontez
AU  - Conko-Camel, Daryl
AU  - El-Zanati, Saad I.
AU  - Liebrecht, Rachel
AU  - Vasquez, Alexander
TI  - Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles
ST  - Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2020
VL  - 40
IS  - 2
SP  - 209
EP  - 225
DO  - https://doi.org/10.7494/OpMath.2020.40.2.209
UR  - https://doi.org/10.7494/OpMath.2020.40.2.209
AB  - It is known that the 3-uniform loose 3-cycle decomposes the complete 3-uniform hypergraph of order \(v\) if and only if \(v \equiv 0, 1,\text{ or }2\ (\operatorname{mod} 9)\). For all positive integers \(\lambda\) and \(v\), we find a maximum packing with loose 3-cycles of the \(\lambda\)-fold complete 3-uniform hypergraph of order \(v\). We show that, if \(v \geq 6\), such a packing has a leave of two or fewer edges.
KW  - maximum packing
KW  - \(\lambda\)-fold complete 3-uniform hypergraph
KW  - loose 3-cycle
SN  - 1232-9274
ER  -