Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
From MaRDI portal
Publication:712220
DOI10.1016/J.DISC.2009.03.047zbMath1221.05253OpenAlexW2146551015MaRDI QIDQ712220
Robert F. Bailey, Brett Stevens
Publication date: 28 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.047
uniform hypergraphHamiltonian cyclelarge setHamiltonian decompositiondifference patterndirected terraceHamiltonian chain
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (26)
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Hamiltonian decomposition of generalized recursive circulant graphs ⋮ Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs ⋮ Unnamed Item ⋮ Packing hamilton cycles in random and pseudo-random hypergraphs ⋮ On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 ⋮ Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs ⋮ Euler tours in hypergraphs ⋮ On tight 6-cycle decompositions of complete 3-uniform hypergraphs ⋮ On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs ⋮ The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles ⋮ Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles ⋮ Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\) ⋮ Unnamed Item ⋮ Graph and hypergraph packing ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Unnamed Item ⋮ Decompositions of complete uniform hypergraphs into Hamilton Berge cycles ⋮ Unnamed Item ⋮ Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs ⋮ Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs ⋮ Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
Uses Software
Cites Work
- Large sets of \(t\)-designs through partitionable sets: a survey
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Universal cycles for combinatorial structures
- Hamilton decompositions of complete 3-uniform hypergraphs
- Round-dance neighbour designs from terraces
- Constructions via Hamiltonian theorems
- Hamiltonian chains in hypergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
