Covering and tiling hypergraphs with tight cycles

DOI10.1017/S0963548320000449zbMath1466.05182MaRDI QIDQ4993263

Nicolás Sanhueza-Matamala, Allan Lo, Jie Han

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

\(k\)-uniform tight cycle; perfect \(F\)-tiling

Mathematics Subject Classification ID

05C65: Hypergraphs

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05D99: Extremal combinatorics