$\ell$-covering $k$-hypergraphs are quasi-eulerian

TL;DR

This paper proves that every $ ext{ell}$-covering $k$-hypergraph with $k ge 2$ admits an Euler family, extending understanding of traversal properties in hypergraphs.

Contribution

It establishes that all $ ext{ell}$-covering $k$-hypergraphs with $k ge 2$ have an Euler family, a significant advancement in hypergraph traversal theory.

Findings

Every $ ext{ell}$-covering $k$-hypergraph admits an Euler family.

The result applies for all $k ge 2$, generalizing previous cases.

Provides new insights into hypergraph traversal properties.

Abstract

An Euler tour in a hypergraph $H$ is a closed walk that traverses each edge of $H$ exactly once, and an Euler family is a family of closed walks that jointly traverse each edge of $H$ exactly once. An $\ell$-covering $k$-hypergraph, for $2 \le \ell < k$, is a $k$-uniform hypergraph in which every $\ell$-subset of vertices lie together in at least one edge. In this paper we prove that every $\ell$-covering $k$-hypergraph, for $k \ge 3$, admits an Euler family.