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 relation...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 310; no. 22; pp. 3088 - 3095
Main Authors Bailey, Robert F., Stevens, Brett
Format Journal Article Conference Proceeding
LanguageEnglish
Published Kidlington Elsevier B.V 28.11.2010
Elsevier
Subjects
Algebra
Combinatorics
Combinatorics. Ordered structures
Construction
Decomposition
Designs and configurations
Difference pattern
Directed terrace
Exact sciences and technology
Graph theory
Hamiltonian chain
Hamiltonian cycle
Hamiltonian decomposition
Large set
Mathematical analysis
Mathematics
Sciences and techniques of general use
Uniform hypergraph
Large set
Directed terrace
Hamiltonian cycle
Uniform hypergraph
Hamiltonian decomposition
Hamiltonian chain
Difference pattern
Hypergraph
Decomposition method
Discrete mathematics
Combinatorics
Hamiltonian
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2009.03.047