Packing tight Hamilton cycles in 3-uniform hypergraphs

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

2010-05-25

arxiv.org/abs/1005.4711v2

Mathematics

Combinatorics

31 pages, 1 figure

Scientific paper

Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C \subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1}, v_{i+2}} is an edge of C (indices are considered modulo N). We develop new techniques which enable us to prove that under certain natural pseudo-random conditions, almost all edges of H can be covered by edge-disjoint tight Hamilton cycles, for N divisible by 4. Consequently, we derive the corollary that random 3-uniform hypergraphs can be almost completely packed with tight Hamilton cycles w.h.p., for N divisible by 4 and P not too small. Along the way, we develop a similar result for packing Hamilton cycles in pseudo-random digraphs with even numbers of vertices.

Affiliated with

Also associated with

No associations

Rating

Packing tight Hamilton cycles in 3-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 3-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 3-uniform hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-604668