Submaps of maps. I: General 0-1 laws
From MaRDI portal
Publication:1210584
DOI10.1016/0095-8956(92)90034-UzbMath0810.05034MaRDI QIDQ1210584
Zhi-Cheng Gao, Edward A. Bender, L. Bruce Richmond
Publication date: 7 February 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (13)
Models of random knots ⋮ Enumerative properties of rooted circuit maps ⋮ Almost all rooted maps have large representativity ⋮ Structure and enumeration of \(K_4\)-minor-free links and link-diagrams ⋮ Random graphs on surfaces ⋮ Submaps of maps. II: Cyclically \(k\)-connected planar cubic maps ⋮ Submaps of maps. III: \(k\)-connected nonplanar maps ⋮ Asymptotic normality determined by high moments, and submap counts of random maps ⋮ 0-1 laws for maps ⋮ Distributions of near-4-regular maps on the sphere and the projective plane ⋮ A pattern theorem for lattice clusters ⋮ A pattern for the asymptotic number of rooted maps on surfaces ⋮ Asymptotic laws for random knot diagrams
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The asymptotic enumeration of rooted convex polyhedra
- The asymptotic number of rooted maps on a surface
- A logical approach to asymptotic combinatorics I. First order properties
- The asymptotic number of rooted nonseparable maps on a surface
- The number of rooted triangular maps on a surface
- The asymptotic number of rooted 2-connected triangular maps on a surface
- Submaps of maps. II: Cyclically \(k\)-connected planar cubic maps
- The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
- The Number of Rooted Convex Polyhedra
- Probabilities on finite models
- On the enumeration of planar maps
- On the Enumeration of Rooted Non-Separable Planar Maps
This page was built for publication: Submaps of maps. I: General 0-1 laws
