Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs

DOI10.1016/j.amc.2020.125492zbMath1497.05224OpenAlexW3042836143MaRDI QIDQ2656703

Yanyan Li

Publication date: 16 March 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2020.125492

zbMATH Keywords

uniform hypergraphsHamilton tight decompositionperfect matching decomposition

Mathematics Subject Classification ID

Hypergraphs (05C65) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51)

Related Items (2)

The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Nombres de coloration de l'hypergraphe h-parti complet
• Hamilton decompositions of complete 3-uniform hypergraphs
• Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Hamiltonian chains in hypergraphs
• Handbook of Graph Theory

This page was built for publication: Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs