Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic (Q6506944)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic |
scientific article from arXiv |
Statements
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic (English)
0 references
