Euler tours in hypergraphs
Combinatorics
2020-03-11 v2
Abstract
We show that a quasirandom -uniform hypergraph has a tight Euler tour subject to the necessary condition that divides all vertex degrees. The case when is complete confirms a conjecture of Chung, Diaconis and Graham from 1989 on the existence of universal cycles for the -subsets of an -set.
Keywords
Cite
@article{arxiv.1808.07720,
title = {Euler tours in hypergraphs},
author = {Stefan Glock and Felix Joos and Daniela Kühn and Deryk Osthus},
journal= {arXiv preprint arXiv:1808.07720},
year = {2020}
}
Comments
version accepted for publication in Combinatorica