The authors establish a degree-sequence condition guaranteeing a matching of size s in k-uniform hypergraphs and relax the n requirement for an Ore-degree matching theorem to n at least 3sk.
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
-
On degree bounds of $k$-uniform hypergraphs with bounded matching number
The authors establish a degree-sequence condition guaranteeing a matching of size s in k-uniform hypergraphs and relax the n requirement for an Ore-degree matching theorem to n at least 3sk.