pith. sign in

Title resolution pending

· 2012

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

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.CO 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

On degree bounds of $k$-uniform hypergraphs with bounded matching number

math.CO · 2026-05-20 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • On degree bounds of $k$-uniform hypergraphs with bounded matching number math.CO · 2026-05-20 · unverdicted · none · ref 12

    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.