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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The number of realisations of a random graph
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.