Hamiltonian decomposition of complete tripartite 3-uniform hypergraphs
A complete tripartite 3-uniform hypergraph \(K_{m,m,m}^{(3)} \) has its vertex set \(V\) partitioned into three subsets \(V_1\), \(V_2\) and \(V_3\) of cardinality \(m\) and its edges are all 3-subsets of vertices which are not contained in any of the \(V_i\). A Hamiltonian cycle in a 3-uniform hypergraph is a cyclic ordering of its vertices such that every consecutive 3-tuple of vertices is an edge. The purpose of the paper under review is to show that the necessary condition for \(K_{m,m,m}^{(3)} \) to have a Hamiltonian decomposition, namely that \(m\) is divisible by 3, is also sufficient. The proof is constructive and uses 1-factors and orthogonal quasigroups.
- Hamilton decomposition of complete 3-uniform hypergraphs
- Hamiltonian decompositions of complete 4-partite 3-uniform hypergraphs
- Hamilton cycle decompositions of k-uniform k-partite hypergraphs
- Decomposing the complete 3-uniform hypergraphs \(k_n^{(3)}\) into Hamiltonian cycles
- Hamiltonian decomposition of complete bipartite r-hypergraphs
- Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
- Hamilton decompositions of block-intersection graphs of Steiner triple systems
- Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs
- scientific article; zbMATH DE number 847840 (Why is no real title available?)
- Defective colorings on k-uniform hypergraphs
- Hamilton decomposition of complete 3-uniform hypergraphs
- Hamiltonian decomposition of complete bipartite r-hypergraphs
- On Hamiltonian decompositions of complete 3-uniform hypergraphs
This page was built for publication: Hamiltonian decomposition of complete tripartite 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2786889)
