Extensions of Gallai's graph covering theorems for uniform hypergraphs

Research output: Contribution to journalArticle

4 Citations (Scopus)


Let H be an r-uniform hypergraph in which the minimum number of edges covering all vertices is ρ{variant} = ρ{variant}(H). In answering two questions of T. Gallai we prove that 1. (1) every collection M of pairwise disjopint edges (=matching) of H is contained in a covering of size at most (2 - r-1)ρ{variant}, and 2. (2) every maximum matching M of H is contained in a covering of size at most (2 - (r - 1)-1)ρ{variant}. Both estimates are sharp.

Original languageEnglish
Pages (from-to)92-96
Number of pages5
JournalJournal of Combinatorial Theory, Series B
Issue number1
Publication statusPublished - May 1991


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this