pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

math.CO 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Berge $k$-Factors of Regular Hypergraphs

math.CO · 2026-04-30 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Berge $k$-Factors of Regular Hypergraphs math.CO · 2026-04-30 · unverdicted · none · ref 2

    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.