On the genus of a random graph

DOI10.1002/RSA.3240060102MaRDI QIDQ4322470zbMATH OpenOpenAlexFDO

Authors Vojtěch Rödl, Robin Thomas

Publication date 9 February 1995

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240060102

zbMATH Keywords

Bernoulli graphedge probabilityembeddinggenusrandom graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The genus of a random graph
• The genus of a random bipartite graph
• Planarity and genus of sparse random bipartite graphs
• The genus of the Erdős-Rényi random graph and the fragile genus property
• An Introduction to Random Topological Graph Theory

Cites work

• Asymptotic behavior of the chromatic index for hypergraphs
• Near perfect coverings in graphs and hypergraphs

Cited in

(11)

• The genus of a random chord diagram is asymptotically normal
• The genus of a random graph
• Formation of a giant component in the intersection graph of a random chord diagram
• On the average genus of the random graph
• The genus of the Erdős-Rényi random graph and the fragile genus property
• Planarity and genus of sparse random bipartite graphs
• The genus of the Erdős-Rényi random graph and the fragile genus property
• The genus of a random bipartite graph
• Classes of graphs embeddable in order-dependent surfaces
• Fragile minor-monotone parameters under a random edge perturbation
• Efficient polynomial-time approximation scheme for the genus of dense graphs

This page was built for publication: On the genus of a random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4322470)