Abstract
We show that 3-graphs on n vertices whose codegree is at least (2/3+o(1))n can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divisibility conditions. We also provide a construction showing that our bounds are best possible up to the o(1) term. All together, our results answer in the negative some recent questions of Glock, Joos, Kühn, and Osthus.
Original language | English |
---|---|
Publisher | arXiv |
Pages | 1-29 |
Number of pages | 29 |
DOIs | |
Publication status | Published - 31 Jan 2021 |
Bibliographical note
28 pages, fixed small errors in references and compilationKeywords
- math.CO
- 05C65, 05C45, 05C70