\ell-covering k-hypergraphs are quasi-eulerian

arXiv2101.11165MaRDI QIDQ6359136FDOQ6359136

Mateja Šajna, Andrew Wagner

Publication date: 26 January 2021

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 $2leell<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 $kge3$, admits an Euler family.

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: $\ell$-covering $k$-hypergraphs are quasi-eulerian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6359136)