Random embeddings of graphs: the expected number of faces in most graphs is logarithmic (Q6645399)
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; zbMATH DE number 7951119
| 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 7951119 |
Statements
Random embeddings of graphs: the expected number of faces in most graphs is logarithmic (English)
0 references
28 November 2024
0 references
