Pith. sign in

Title resolution pending

· 2016

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

2024 1

verdicts

CONDITIONAL 1

representative citing papers

On tight tree-complete hypergraph Ramsey numbers

math.CO · 2024-12-27 · conditional · novelty 7.0

For r=3 and r=4, every non-trivial tight r-tree T satisfies R(T,n)=Theta(n^(r-1)), with the 4-uniform case proved by a new explicit construction.

citing papers explorer

Showing 1 of 1 citing paper.

  • On tight tree-complete hypergraph Ramsey numbers math.CO · 2024-12-27 · conditional · none · ref 1

    For r=3 and r=4, every non-trivial tight r-tree T satisfies R(T,n)=Theta(n^(r-1)), with the 4-uniform case proved by a new explicit construction.