Random graphs on surfaces

DOI10.1016/j.jctb.2007.11.006zbMath1154.05021OpenAlexW2024781825MaRDI QIDQ933680

Colin J. H. McDiarmid

Publication date: 24 July 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.11.006

zbMATH Keywords

Planar graphgraph embeddable on a surfaceuniform random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (21)

Classes of graphs embeddable in order-dependent surfaces ⋮ On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles ⋮ Concentration of maximum degree in random planar graphs ⋮ Random graphs from a weighted minor-closed class ⋮ Longest and shortest cycles in random planar graphs ⋮ The evolution of random graphs on surfaces ⋮ Asymptotic enumeration and limit laws for graphs of fixed genus ⋮ Local convergence of random planar graphs ⋮ Unprovability threshold for the planar graph minor theorem ⋮ The Evolution of Random Graphs on Surfaces ⋮ Weakly distinguishing graph polynomials on addable properties ⋮ Phase transitions in graphs on orientable surfaces ⋮ On graphs with few disjoint \(t\)-star minors ⋮ Random Graphs from a Minor-Closed Class ⋮ Logical limit laws for minor-closed classes of graphs ⋮ Random graphs containing few disjoint excluded minors ⋮ Degree distribution in random planar graphs ⋮ Growth constants of minor-closed classes of graphs ⋮ Unlabelled Gibbs partitions ⋮ Two critical periods in the evolution of random planar graphs ⋮ Graph classes with given 3-connected components: Asymptotic enumeration and random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coefficients of functional compositions often grow smoothly
• The asymptotic number of rooted maps on a surface
• The asymptotic number of rooted nonseparable maps on a surface
• Submaps of maps. I: General 0-1 laws
• A pattern for the asymptotic number of rooted maps on surfaces
• On random planar graphs, the number of planar graphs and their triangulations
• Asymptotic normality determined by high moments, and submap counts of random maps
• Random planar graphs
• The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces
• The number of labeled 2-connected planar graphs
• Almost all maps are asymmetric
• Separating and nonseparating disjoint homotopic cycles in graph embeddings
• Proper minor-closed families are small
• Planar graphs, via well-orderly maps and trees
• Submap Density and Asymmetry Results for Two Parameter Map Families
• Random cubic planar graphs
• On the Maximum Degree of a Random Planar Graph
• Blocks and the nonorientable genus of graphs
• On the independence ratio of a graph
• 0-1 laws for maps
• Almost all rooted maps have large representativity
• On the Number of Edges in Random Planar Graphs
• Generating Outerplanar Graphs Uniformly at Random

This page was built for publication: Random graphs on surfaces