For hypergraphs, the largest k allowing a Berge k-factor in every λ-edge-connected r-regular hypergraph is bounded above by a function of the rank, stronger than the classical connectivity bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Berge $k$-Factors of Regular Hypergraphs
For hypergraphs, the largest k allowing a Berge k-factor in every λ-edge-connected r-regular hypergraph is bounded above by a function of the rank, stronger than the classical connectivity bound.