Extensions of Gallai's graph covering theorems for uniform hypergraphs (Q1179466): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:52, 29 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extensions of Gallai's graph covering theorems for uniform hypergraphs |
scientific article |
Statements
Extensions of Gallai's graph covering theorems for uniform hypergraphs (English)
0 references
26 June 1992
0 references
Let \(H\) be an \(r\)-uniform hypergraph in which the minimum number of edges covering all vertices is \(p\). It is proved that every matching of \(H\) is contained in a covering of size at most \((2-r^{-1})p\) and every maximum matching of \(H\) is contained in a covering of size at most \((2-(r-1)^{- 1})p\).
0 references
Gallai's graph covering theorems
0 references
hypergraph
0 references
matching
0 references
covering
0 references