Abstract
We show that for every even integer s≥6 there is n0 such that, if H is a 3-uniform hypergraph on nϵsZ, n ≥n0 vertices such that the minimum co-degree of H is at least (Formula presented.), then H can be tiled with copies of a loose cycle on s vertices. The co-degree condition is tight.
Original language | English (US) |
---|---|
Pages (from-to) | 317-333 |
Number of pages | 17 |
Journal | Journal of Graph Theory |
Volume | 83 |
Issue number | 4 |
DOIs | |
State | Published - Dec 1 2016 |
Keywords
- hypergraphs
- loose cycles
ASJC Scopus subject areas
- Geometry and Topology