학술논문
l-COVERING k-HYPERGRAPHS ARE QUASI-EULERIAN.
Document Type
Article
Author
Source
Subject
*HYPERGRAPHS
*FAMILIES
*TOURS
*
*
Language
ISSN
1234-3099
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 ℓ-covering k-hypergraph, for 2 ≤ ℓ < k, is a k-uniform hypergraph in which every ℓ-subset of vertices lie together in at least one edge. In this paper we prove that every ℓ-covering k-hypergraph, for k ≥ 3, admits an Euler family. [ABSTRACT FROM AUTHOR]