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.
Similar content being viewed by others
References
R. F. BAILEY and B. STEVENS: Hamiltonian decompositions of complete k-uniform hypergraphs, Discrete Math.310 (2010), 3088–3095.
D. BAL and A. FRIEZE: Packing tight Hamilton cycles in uniform hypergraphs, SIAM J. Discrete Math.26 (2012), 435–451.
Z. BARANYAI: The edge-coloring of complete hypergraphs. I, J. Combin. Theory Ser. B26 (1979), 276–294.
S. R. BLACKBURN: The existence of k-radius sequences, J. Combin. Theory Ser. A119 (2012), 212–217.
F. CHUNG, P. DLACONIS and R. GRAHAM: Universal cycles for combinatorial structures, Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida, 1989), Congr. Numer. 70-74, Utilitas Math., 1990.
F. CHUNG, P. DLACONIS and R. GRAHAM: Universal cycles for combinatorial structures, Discrete Math.110 (1992), 43–59.
D. CURTIS, T. HINES, G. HURLBERT and T. MOYER: Near-universal cycles for subsets exist, SIAM J. Discrete Math.23 (2009), 1441–1449.
M. DEBSKI and Z. LONC: Universal cycle packings and coverings for k-subsets of an n-set, Graphs Combin.32 (2016), 2323–2337.
A. FRIEZE and M. KRIVELEVICH: Packing Hamilton cycles in random and pseudorandom hypergraphs, Random Structures Algorithms41 (2012), 1–22.
A. FRIEZE, M. KRIVELEVICH and P.-S. Loh: Packing tight Hamilton cycles in 3-uniform hypergraphs, Random Structures Algorithms40 (2012), 269–300.
S. GLOCK, D. Kühn, A. LO and D. OSTHUS: The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F, Mem. Amer. Math. Soc. (to appear).
V. HORAN and G. HURLBERT: 1-overlap cycles for Steiner triple systems, Des. Codes Cryptogr.72 (2014), 637–651.
V. HORAN and G. HLJRLBERT: Overlap cycles for Steiner quadruple systems, J. Cornbin. Des.22 (2014), 53–70.
G. HIJRLBERT: On universal cycles for k-subsets of an n-set, SIAM J. Discrete Math.7 (1994), 598–604.
B. W. JACKSON: Universal cycles of k-subsets and k-permutations, Discrete Math.117 (1993), 141–150.
J. R. JOHNSON: Universal cycles for permutations, Discrete Math.309 (2009), 5264–5270.
P. KEEVASH: The existence of designs II, arXiv:1802.05900 (2018).
D. KIJHN and D. OSTHUS: Decompositions of complete uniform hypergraphs into Hamilton Berge cycles, J. Combin. Theory Ser. A126 (2014), 128–135.
Z. LONC and P. NAROSKI: On tours that contain all edges of a hypergraph, Electron. J. COMBIN.17 (2010).
Z. LONC, P. NAROSKI and P. RZAZEWSKI: Tight Euler tours in uniform hypergraphs - computational aspects, Discrete Math. Theor. Comput. Sci.19 (2017).
Z. LONC, T. TRACZYK and M. TRUSZCZYNSKI: Optimal f-graphs for the family of all k-subsets of an n-set, Data base file organization (Warsaw, 1981), Notes Rep. Comput. Sci. Appl. Math. 6, Academic Press, New York, 1983, 247–270.
V. RODL, A. RUCIŃSKI and E. SZEMERÉDI: An approximate Dirac-type theorem for k-uniform hypergraphs, Combinatorica28 (2008), 229–260.
M. SAJNA and A. WAGNER: Triple systems are Eulerian, J. Combin. Des.25 (2017), 185–191.
R. M. WILSON: Decompositions of complete graphs into subgraphs isomorphic to a given graph, Proceedings of the Fifth British Combinatorial Conference (Aberdeen, 1975), Congr. Numer. 15, Utilitas Math., 1976, 647–659.
Y. ZHAO: Recent advances on Dirac-type problems for hypergraphs, in: Recent trends in combinatorics (A. Beveridge, J.R. Griggs, L. Hpogben, G. Musiker, and P. Tetali, eds.), IMA Vol. Math. Appl. 159, Springer, 2016, 145–165.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research leading to these results was partially supported by the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant 306349 (S. Glock and D. Osthus), and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 339933727 (F. Joos). The research was also partially supported by the EPSRC, grant no. EP/N019504/1, and by the Royal Society and the Wolfson Foundation (D. Kühn).
Rights and permissions
About this article
Cite this article
Glock, S., Joos, F., Kühn, D. et al. Euler Tours in Hypergraphs. Combinatorica 40, 679–690 (2020). https://doi.org/10.1007/s00493-020-4046-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-020-4046-8