arXiv (All)
open access
The number of realisations of a random graph
Determining the number of realisations, up to isometries, of a graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we prove that, asymptotically almost surely, the $d$-dimensional complex realisation number for each $n$-vertex graph in an Erdős-
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- First-Order Laws for Random Geometric Graphs on the Torus#1062130
- Counterexamples to the Mao-Wu-Xu spectral conjecture and a three-scale boundary for spherical random graphs#1013687
- The $Δ$-Conjecture for CIS $d$-Graphs#677725
- The $Δ$-Conjecture for CIS $d$-Graphs#674522
- Fast Graph Laplacian Estimation using Effective Resistance#1049405
Record · ID 820460
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive