Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs

Simon Piga, Nicolás Sanhueza-Matamala

Research output: Contribution to journalArticle

1 Downloads (Pure)

Abstract

We show that 3-graphs 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
Pages (from-to) 350-358
JournalProcedia Computer Science
Volume195
DOIs
Publication statusPublished - 5 Jan 2022

Keywords

  • Hypergraphs
  • Euler tours
  • Cycles
  • Decompositions

Fingerprint

Dive into the research topics of 'Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs'. Together they form a unique fingerprint.

Cite this