Euler tours in hypergraphs

DOI10.1007/s00493-020-4046-8zbMath1474.05287arXiv1808.07720OpenAlexW3027379288MaRDI QIDQ2658380

Stefan Glock, Deryk Osthus, Felix Joos, Daniela Kühn

Publication date: 20 March 2021

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.07720

zbMATH Keywords

hypergraphsuniversal cycleEuler tourEuler trail\(F\)-decomposition

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of packing and covering (05B40) Random walks on graphs (05C81)

Related Items (2)

The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Graph universal cycles of combinatorial objects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
• On tours that contain all edges of a hypergraph
• The existence of \(k\)-radius sequences
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Universal cycles for permutations
• Universal cycles for combinatorial structures
• The edge-coloring of complete hypergraphs. I
• Counting designs
• 1-overlap cycles for Steiner triple systems
• Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing hamilton cycles in random and pseudo-random hypergraphs
• Packing Tight Hamilton Cycles in Uniform Hypergraphs
• Recent advances on Dirac-type problems for hypergraphs
• Near-Universal Cycles for Subsets Exist
• On Universal Cycles for k-Subsets of an n-Set
• Triple Systems are Eulerian
• Overlap Cycles for Steiner Quadruple Systems
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

This page was built for publication: Euler tours in hypergraphs