Expected number of faces in a random embedding of any graph is at most linear (Q6085874): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1017/s096354832300010x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1017/S096354832300010X / rank | |||
Normal rank | |||
Latest revision as of 19:18, 30 December 2024
scientific article; zbMATH DE number 7762895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Expected number of faces in a random embedding of any graph is at most linear |
scientific article; zbMATH DE number 7762895 |
Statements
Expected number of faces in a random embedding of any graph is at most linear (English)
0 references
8 November 2023
0 references
random embeddings
0 references
average genus
0 references
random topological graph theory
0 references
