@Article{Bunge2020,
author = "Bunge, Ryan C. and Collins, Dontez and Conko-Camel, Daryl and El-Zanati, Saad I. and Liebrecht, Rachel and Vasquez, Alexander",
title = "Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles",
journal = "Opuscula Math.",
year = "2020",
volume = "40",
number = "2",
pages = "209--225",
doi = "https://doi.org/10.7494/OpMath.2020.40.2.209",
url = "https://doi.org/10.7494/OpMath.2020.40.2.209",
abstract = "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.",
keywords = "maximum packing, \(\lambda\)-fold complete 3-uniform hypergraph, loose 3-cycle",
issn = "1232-9274"
}