pith. sign in

Title resolution pending

Bill Jackson, John C · 2019 · DOI 10.1016/j.dam.2017

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

1 Pith paper citing it
open at publisher 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

The number of realisations of a random graph

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

For Erdős-Rényi random graphs the d-dimensional realization count is infinity or 2^k with k polynomial-time computable; analogous result for generic PSD matrix completion.

citing papers explorer

Showing 1 of 1 citing paper.

  • The number of realisations of a random graph math.CO · 2026-05-18 · unverdicted · none · ref 19

    For Erdős-Rényi random graphs the d-dimensional realization count is infinity or 2^k with k polynomial-time computable; analogous result for generic PSD matrix completion.