On the average genus of the random graph
From MaRDI portal
Publication:4843501
Recommendations
Cited in
(18)- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- The expected genus of a random chord diagram
- Asymptotics of local face distributions and the face distribution of the complete graph
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Random 2-cell embeddings of multistars
- On the average crosscap number. II: Bounds for a graph
- Bounds for the average genus of the vertex-amalgamation of graphs
- Cubic graphs whose average number of regions is small
- scientific article; zbMATH DE number 4095487 (Why is no real title available?)
- New bounds for the average genus and average number of faces of a simple graph
- scientific article; zbMATH DE number 3843773 (Why is no real title available?)
- Limits for embedding distributions
- Expected number of faces in a random embedding of any graph is at most linear
- The genus of a random graph
- On the local genus distribution of graph embeddings
- The genus of a random bipartite graph
- An Introduction to Random Topological Graph Theory
- Remarks on the lower bounds for the average genus
This page was built for publication: On the average genus of the random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4843501)