Packing tight Hamilton cycles in uniform hypergraphs

Details Packing tight Hamilton cycles in uniform hypergraphs Packing tight Hamilton cycles in uniform hypergraphs

2011-02-08

arxiv.org/abs/1102.1488v1

Mathematics

Combinatorics

18 pages

Scientific paper

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le 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}\setminus E_i|=\ell$. 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 $\ell$ Hamilton cycles, where $\ell

Affiliated with

Also associated with

No associations

Rating

Packing tight Hamilton cycles in uniform hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Packing tight Hamilton cycles in uniform hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packing tight Hamilton cycles in uniform hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-501914