Euler tours in hypergraphs

Stefan Glock, Felix Joos, Daniela Kuhn, Deryk Osthus

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
146 Downloads (Pure)


We show that a quasirandom k-uniform hypergraph has a tight Euler tour subject to the necessary condition that k divides all vertex degrees.
The case when G is complete confirms a conjecture of Chung, Diaconis and Graham from 1989 on the existence of universal cycles for the k-subsets of an n-set.
Original languageEnglish
Pages (from-to)679-690
Number of pages12
Issue number5
Early online date22 May 2020
Publication statusE-pub ahead of print - 22 May 2020

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics


Dive into the research topics of 'Euler tours in hypergraphs'. Together they form a unique fingerprint.

Cite this