Hamiltonian decompositions of complete k-uniform hypergraphs

被引：40

作者：

Bailey, Robert F. ^{[1
]}

Stevens, Brett ^{[1
]}

机构：

[1] Carleton Univ, Sch Math & Stat, Ottawa, ON K1S 5B6, Canada

来源：

DISCRETE MATHEMATICS | 2010年 / 310卷 / 22期

关键词：

Uniform hypergraph; Hamiltonian cycle; Hamiltonian chain; Hamiltonian decomposition; Large set; Directed terrace; Difference pattern; 3-UNIFORM HYPERGRAPHS; DESIGNS; CYCLES;

D O I：

10.1016/j.disc.2009.03.047

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2009 Elsevier B.V. All rights reserved.

引用

页码：3088 / 3095

页数：8

共 23 条

[1]

Alspach B., 2008, Bull. Inst. Comb. Appl., V52, P7

[2]

[Anonymous], 1987, ANN DISCRETE MATH, V33, P207

[3] Round-dance neighbour designs from terraces [J].

Bailey, RA ;

Ollis, MA ;

Preece, DA .

DISCRETE MATHEMATICS, 2003, 266 (1-3) :69-86

[4]

BAILEY RA, 1984, J ROY STAT SOC B MET, V46, P323

[5]

Baranyai Z., 1975, INFINITE FINITE SETS, V10, P91

[6]

Berge C., 1970, MONOGRAPHES U MATH, V37

[7]

BERMOND JC, 1978, C INTERNAT CNRS, V260

[8]

BRYANT DE, 2007, LONDON MATH SOC LECT, V346

[9]

Cameron P.J., 1976, LONDON MATH SOC LECT, V23

[10]

Cayley A., 1850, London, Edinburgh and Dublin Philos Mag and J Sci, V37, P50, DOI DOI 10.1080/14786445008646550

← 1 2 3 →