### Abstract

We say that a k-uniform hypergraph C is a Hamilton cycle of type l, for some 1 ≤ l ≤ 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 \ E _{i}| = l. We define a class of (ε, p)-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type l Hamilton cycles, where l < k/2.

Original language | English |
---|---|

Pages (from-to) | 435-451 |

Number of pages | 17 |

Journal | SIAM Journal on Discrete Mathematics |

Volume | 26 |

Issue number | 2 |

DOIs | |

State | Published - 6 Sep 2012 |

### Fingerprint

### Keywords

- Hamilton cycles
- Packings
- Pseudorandom hypergraphs

### Cite this

*SIAM Journal on Discrete Mathematics*,

*26*(2), 435-451. https://doi.org/10.1137/11082378X

}

*SIAM Journal on Discrete Mathematics*, vol. 26, no. 2, pp. 435-451. https://doi.org/10.1137/11082378X

**Packing tight hamilton cycles in uniform hypergraphs.** / Bal, Deepak; Frieze, Alan.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Packing tight hamilton cycles in uniform hypergraphs

AU - Bal, Deepak

AU - Frieze, Alan

PY - 2012/9/6

Y1 - 2012/9/6

N2 - We say that a k-uniform hypergraph C is a Hamilton cycle of type l, for some 1 ≤ l ≤ 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 \ E i| = l. We define a class of (ε, p)-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type l Hamilton cycles, where l < k/2.

AB - We say that a k-uniform hypergraph C is a Hamilton cycle of type l, for some 1 ≤ l ≤ 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 \ E i| = l. We define a class of (ε, p)-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type l Hamilton cycles, where l < k/2.

KW - Hamilton cycles

KW - Packings

KW - Pseudorandom hypergraphs

UR - http://www.scopus.com/inward/record.url?scp=84865623415&partnerID=8YFLogxK

U2 - 10.1137/11082378X

DO - 10.1137/11082378X

M3 - Article

AN - SCOPUS:84865623415

VL - 26

SP - 435

EP - 451

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -