Almost all maps are asymmetric
From MaRDI portal
Publication:1892827
DOI10.1006/jctb.1995.1001zbMath0820.05017OpenAlexW2042987883MaRDI QIDQ1892827
L. Bruce Richmond, Nicholas C. Wormald
Publication date: 2 July 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1001
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (22)
Characterisation of symmetries of unlabelled triangulations ⋮ Models of random knots ⋮ Limit of normalized quadrangulations: the Brownian map ⋮ Enumerative properties of rooted circuit maps ⋮ A phase transition in block-weighted random maps ⋮ Unnamed Item ⋮ Structure and enumeration of \(K_4\)-minor-free links and link-diagrams ⋮ Symmetries of unlabelled planar triangulations ⋮ Uniform infinite planar triangulations ⋮ The distribution of the maximum vertex degree in random planar maps ⋮ Random graphs on surfaces ⋮ 4-edge-connected 4-regular maps on the projective plane ⋮ Counting 5-connected planar triangulations ⋮ The bivariate Ising polynomial of a graph ⋮ On the Asymptotic Number of Plane Curves and Alternating Knots ⋮ Asymptotic normality determined by high moments, and submap counts of random maps ⋮ Random maps, coalescing saddles, singularity analysis, and Airy phenomena ⋮ 0-1 laws for maps ⋮ Structure and enumeration of \(K_{4}\)-minor-free links and link diagrams ⋮ Distributions of near-4-regular maps on the sphere and the projective plane ⋮ Enumeration of rooted planar triangulations with respect to diagonal flips ⋮ Asymptotic laws for random knot diagrams
This page was built for publication: Almost all maps are asymmetric
