Packing tight Hamilton cycles in uniform hypergraphs

Publication date 12 September 2012

Abstract: We say that a

k

-uniform hypergraph

C

is a Hamilton cycle of type

e l l

, for some

1 l e e l l l e k

, if there exists a cyclic ordering of the vertices of

C

such that every edge consists of

k

consecutive vertices and for every pair of consecutive edges

E_{i - 1}, E_{i}

in

C

(in the natural ordering of the edges) we have

| E_{i - 1} s e t m i n u s E_{i} | = e l l

. We define a class of

(e, p)

-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type

e l l

Hamilton cycles, where

e l l < k / 2

.

Recommendations

Cited in

(21)

This page was built for publication: Packing tight Hamilton cycles in uniform hypergraphs