8 citations · 22 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Covering hypergraphs are eulerian
Mateja Šajna, Andrew Wagner
An Euler tour in a hypergraph (also called a rank-2 universal cycle or 1-overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this p…
math.CO2021
Using edge cuts to find Euler tours and Euler families in hypergraphs
Mateja Šajna, Andrew Wagner
An Euler tour in a hypergraph is a closed walk that traverses each edge of the hypergraph exactly once, while an Euler family is a family of closed walks that jointly traverse each…