On the average genus of the random graph
From MaRDI portal
Publication:4843501
DOI10.1002/JGT.3190200102zbMATH Open0840.05083OpenAlexW2080139790MaRDI QIDQ4843501FDOQ4843501
Authors: Saul Stahl 
Publication date: 27 June 1996
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190200102
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
Cited In (18)
- Random 2-cell embeddings of multistars
- On the average crosscap number. II: Bounds for a graph
- Title not available (Why is that?)
- An Introduction to Random Topological Graph Theory
- The genus of a random graph
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Cubic graphs whose average number of regions is small
- On the local genus distribution of graph embeddings
- The genus of a random bipartite graph
- Asymptotics of local face distributions and the face distribution of the complete graph
- Limits for embedding distributions
- Title not available (Why is that?)
- New bounds for the average genus and average number of faces of a simple graph
- Expected number of faces in a random embedding of any graph is at most linear
- Remarks on the lower bounds for the average genus
- The expected genus of a random chord diagram
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Bounds for the average genus of the vertex-amalgamation of graphs
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)
