Sciweavers

Share
DM
2010

Hamiltonian decompositions of complete k-uniform hypergraphs

9 years 9 months ago
Hamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We then consider the problem of constructing such decompositions for complete uniform hypergraphs, and describe its relationship with other topics, such as design theory.
Robert F. Bailey, Brett Stevens
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where DM
Authors Robert F. Bailey, Brett Stevens
Comments (0)
books