Pith. sign in

Title resolution pending

· 2024 · arXiv 2406.05748

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

1 Pith paper citing it
read on arXiv 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

On cliques in hypergraphs under bounded $(j,p)$-norm

math.CO · 2026-06-01 · unverdicted · novelty 6.0

Determines the maximum number of t-cliques in n-vertex r-graphs with bounded (j,p)-norm when p>(t-j)/(r-j), proved via entropy plus interpolation and sharp for Steiner systems.

citing papers explorer

Showing 1 of 1 citing paper.

  • On cliques in hypergraphs under bounded $(j,p)$-norm math.CO · 2026-06-01 · unverdicted · none · ref 14

    Determines the maximum number of t-cliques in n-vertex r-graphs with bounded (j,p)-norm when p>(t-j)/(r-j), proved via entropy plus interpolation and sharp for Steiner systems.