Perfect matching and Hamilton tight cycle decomposition of complete n-balanced r-partite k-uniform hypergraphs

DOI10.1137/20M1365557zbMATH Open1482.05244OpenAlexW4213303698MaRDI QIDQ5028355FDOQ5028355

Authors:

Publication date: 9 February 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/20m1365557

Recommendations

• The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs
• Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
• Hamilton cycle decompositions of \(k\)-uniform \(k\)-partite hypergraphs
• On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs

zbMATH Keywords

\(r\)-partite\(k\)-uniform hypergraphperfect matching decompositionHamilton tight cycle decomposition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Hamiltonian chains in hypergraphs
• Handbook of Graph Theory
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Title not available (Why is that?)
• Hamilton decompositions of complete 3-uniform hypergraphs
• Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
• On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
• Title not available (Why is that?)
• Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
• Nombres de coloration de l'hypergraphe h-parti complet
• Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs

Cited In (3)

• The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs
• Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
• A note on Hamilton \(\ell\)-cycle decomposition of complete \(k\)-partite hypergraphs

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

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