Showing math.COShow all
3 papers · 1 filter
math.CO2021
-covering -hypergraphs are quasi-eulerian
Mateja Šajna, Andrew Wagner
An Euler tour in a hypergraph is a closed walk that traverses each edge of exactly once, and an Euler family is a family of closed walks that jointly traverse each edge of…
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.CO2019
Eulerian Properties of Design Hypergraphs and Hypergraphs with Small Edge Cuts
Andrew Wagner
An Euler tour of a hypergraph is a closed walk that traverses every edge exactly once; if a hypergraph admits such a walk, then it is called eulerian. Although this notion is one o…