pith. machine review for the scientific record. sign in

Title resolution pending

· 1995

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

representative citing papers

Intersecting families with covering number three II

math.CO · 2026-05-09 · unverdicted · novelty 4.0

Any intersecting k-graph with covering number at least three satisfies the stated binomial-coefficient upper bound for all n greater than or equal to 2k.

citing papers explorer

Showing 1 of 1 citing paper.

  • Intersecting families with covering number three II math.CO · 2026-05-09 · unverdicted · none · ref 7

    Any intersecting k-graph with covering number at least three satisfies the stated binomial-coefficient upper bound for all n greater than or equal to 2k.