Hamiltonian decompositions of complete k-uniform hypergraphs
From MaRDI portal
Publication:712220
Recommendations
- On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
- Hamilton cycle decompositions of \(k\)-uniform \(k\)-partite hypergraphs
- Hamiltonian decompositions of complete graphs
- Hamilton decompositions of complete 3-uniform hypergraphs
- Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
- Hamilton decomposition of complete 3-uniform hypergraphs
- On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
- Hamiltonian decompositions of complete 4-partite 3-uniform hypergraphs
- Decomposing the complete 3-uniform hypergraphs \(k_n^{(3)}\) into Hamiltonian cycles
Cites work
- scientific article; zbMATH DE number 3887706 (Why is no real title available?)
- scientific article; zbMATH DE number 4047735 (Why is no real title available?)
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- scientific article; zbMATH DE number 3520420 (Why is no real title available?)
- scientific article; zbMATH DE number 3641483 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Constructing combinatorial objects via cliques
- Constructions via Hamiltonian theorems
- Cycle decompositions of complete graphs
- Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
- Hamilton decompositions of complete 3-uniform hypergraphs
- Hamiltonian chains in hypergraphs
- Large sets of \(t\)-designs through partitionable sets: a survey
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Round-dance neighbour designs from terraces
- The wonderful Walecki construction
- Universal cycles for combinatorial structures
Cited in
(45)- On tight 6-cycle decompositions of complete 3-uniform hypergraphs
- Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs
- On maximum packings of \(\lambda \)-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
- On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs
- Large sets of wrapped K-K Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
- Recent advances on the Hamiltonian problem: survey III
- scientific article; zbMATH DE number 1472137 (Why is no real title available?)
- On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
- scientific article; zbMATH DE number 6273737 (Why is no real title available?)
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
- Hypercycle systems
- On Hamiltonian decompositions of complete 3-uniform hypergraphs
- Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
- 4-cycle decompositions of complete 3-uniform hypergraphs
- Hamilton decomposition of complete 3-uniform hypergraphs
- Hamiltonian decomposition of generalized recursive circulant graphs
- scientific article; zbMATH DE number 7731175 (Why is no real title available?)
- On tight 9-cycle decompositions of complete 3-uniform hypergraphs
- Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
- Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\)
- Hamiltonian uniform subset graphs
- Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
- Hamilton cycle decompositions of \(k\)-uniform \(k\)-partite hypergraphs
- On 2-factorizations of the complete 3-uniform hypergraph of order 12 minus a 1-factor
- On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges
- Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares
- The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs
- Hamilton decompositions of complete 3-uniform hypergraphs
- Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
- Perfect matching and Hamilton tight cycle decomposition of complete \(n\)-balanced \(r\)-partite \(k\)-uniform hypergraphs
- Graph and hypergraph packing
- scientific article; zbMATH DE number 847840 (Why is no real title available?)
- Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\)
- scientific article; zbMATH DE number 7283879 (Why is no real title available?)
- scientific article; zbMATH DE number 7640248 (Why is no real title available?)
- Steiner system and large non-Hamiltonian hypergraphs
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- A note on Hamilton \(\ell\)-cycle decomposition of complete \(k\)-partite hypergraphs
- Hamiltonian decompositions of complete 4-partite 3-uniform hypergraphs
- Decomposing complete 3-uniform hypergraph \(k_n^{(3)}\) into 7-cycles
- Constructions via Hamiltonian theorems
- Euler tours in hypergraphs
This page was built for publication: Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712220)
