Cycle decompositions in 3-uniform hypergraphs

Simón Piga, Nicolás Sanhueza-Matamala

Research output: Working paper/PreprintPreprint

1 Downloads (Pure)

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 languageEnglish
PublisherarXiv
Pages1-29
Number of pages29
DOIs
Publication statusPublished - 31 Jan 2021

Bibliographical note

28 pages, fixed small errors in references and compilation

Keywords

  • math.CO
  • 05C65, 05C45, 05C70

Fingerprint

Dive into the research topics of 'Cycle decompositions in 3-uniform hypergraphs'. Together they form a unique fingerprint.

Cite this