Proves that d_{2sk+1} > binom(n-1,k-1) - binom(n-s,k-1) implies matching number at least s in k-uniform hypergraphs (n>2sk), generalizes prior results, shows k+2s-2 is optimal for a relaxed index, and improves the n bound for the Ore-degree condition to 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
No citing papers match the current filters.