We give a hypergraph generalization of Gallai's theorem about factor-critical graphs. This result can be used to determine τ*(r, t) for r < 3 t/2, where τ*(r, t) denotes the maximum value of the fractional covering numbers of t-wise intersecting hypergraphs of rank r.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics