Pith. sign in

Title resolution pending

· 1961

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

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Embedding loose trees in $k$-uniform hypergraphs

math.CO · 2025-02-07 · conditional · novelty 7.0

For k at least 4, sufficiently large k-uniform hypergraphs with minimum (k-2)-degree at least (1/2+gamma) binom(n,k-2) contain every spanning loose tree of maximum degree at most Delta.

citing papers explorer

Showing 1 of 1 citing paper.

  • Embedding loose trees in $k$-uniform hypergraphs math.CO · 2025-02-07 · conditional · none · ref 5

    For k at least 4, sufficiently large k-uniform hypergraphs with minimum (k-2)-degree at least (1/2+gamma) binom(n,k-2) contain every spanning loose tree of maximum degree at most Delta.