Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic (Q6506944)
From MaRDI portal
scientific article; zbMATH DE number 900550933
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic |
scientific article; zbMATH DE number 900550933 |
Statements
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic (English)
0 references
1 January 1 CEGregorian
0 references
