Cycle decompositions in k-uniform hypergraphs

DOI10.1016/J.JCTB.2024.02.003MaRDI QIDQ6500099zbMATH OpenFDO

Authors Allan Lo, Simón Piga, Nicolás Sanhueza-Matamala

Publication date 10 May 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.02.003

zbMATH Keywords

absorberscyclesEuler tours

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Cycle decompositions in 3-uniform hypergraphs
• Fractional cycle decompositions in hypergraphs
• Packing tight Hamilton cycles in uniform hypergraphs
• Decomposing hypergraphs into cycle factors
• Decomposition of complete 3-uniform hypergraphs K^3_n into cycles for n = 7, 10

Cites work

• Covering and tiling hypergraphs with tight cycles
• Cycle decompositions in 3-uniform hypergraphs
• Decomposing highly edge-connected graphs into paths of any given length
• Edge-decompositions of graphs with high minimum degree
• Euler tours in hypergraphs
• Extremal aspects of graph and hypergraph decomposition problems
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Integer and fractional packings of hypergraphs
• Minimalist designs
• On a hypergraph matching problem
• On the exact decomposition threshold for even cycles
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• Universal cycles for combinatorial structures

Cited in

(1)

• Cycle decompositions in 3-uniform hypergraphs

This page was built for publication: Cycle decompositions in \(k\)-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6500099)