Euler tours in hypergraphs

Stefan Glock; Felix Joos; Daniela Kuhn; Deryk Osthus

doi:10.1007/s00493-020-4046-8

Euler tours in hypergraphs

Stefan Glock, Felix Joos, Daniela Kuhn, Deryk Osthus

Mathematics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

175 Downloads (Pure)

Abstract

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.

Original language	English
Pages (from-to)	679-690
Number of pages	12
Journal	Combinatorica
Volume	40
Issue number	5
Early online date	22 May 2020
DOIs	https://doi.org/10.1007/s00493-020-4046-8
Publication status	E-pub ahead of print - 22 May 2020

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/s00493-020-4046-8Licence: None: All rights reserved

Glock_et_al_Euler_tours_in_hypergraphs_Combinatorica_2020
This is a post-peer-review, pre-copyedit version of an article published in Combinatorica. The final authenticated version is available online at: https://doi.org/10.1007/s00493-020-4046-8
Accepted author manuscript, 316 KBLicence: None: All rights reserved

https://link.springer.com/article/10.1007/s00493-020-4046-8Licence: None: All rights reserved

Cite this

@article{35b42c39b2e3491586e727fa5bf9762d,

title = "Euler tours in hypergraphs",

abstract = "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.",

author = "Stefan Glock and Felix Joos and Daniela Kuhn and Deryk Osthus",

year = "2020",

month = may,

day = "22",

doi = "10.1007/s00493-020-4046-8",

language = "English",

volume = "40",

pages = "679--690",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Springer",

number = "5",

}

TY - JOUR

T1 - Euler tours in hypergraphs

AU - Glock, Stefan

AU - Joos, Felix

AU - Kuhn, Daniela

AU - Osthus, Deryk

PY - 2020/5/22

Y1 - 2020/5/22

N2 - 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.

AB - 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.

UR - https://www.springer.com/journal/493

UR - https://arxiv.org/abs/1808.07720

U2 - 10.1007/s00493-020-4046-8

DO - 10.1007/s00493-020-4046-8

M3 - Article

SN - 0209-9683

VL - 40

SP - 679

EP - 690

JO - Combinatorica

JF - Combinatorica

IS - 5

ER -

Euler tours in hypergraphs

Abstract

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this