2018/08/23 by Stefan Glock, Felix Joos, Glock, Stefan +5 · 1 citation
Engineering · Mathematics · #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1808.07720
version accepted for publication in Combinatorica
openalex publication_date 2018/08/23 · arxiv created 2020/03/10 · arxiv updated 2020/03/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that a quasirandom k-uniform hypergraph G 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.