Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof
arXiv:cond-mat/0207682 · doi:10.1016/S0550-3213(02)00813-1
Abstract
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an alternative and purely combinatorial solution to the problem of counting arbitrary planar maps with prescribed vertex degrees.
29 pages, 14 figures, tex, harvmac, epsf
References in corpus (1)
Cited by in corpus (26)
- Geodesic Distance in Planar Graphs
- Counting colored planar maps: algebraicity results
- The three-point function of planar quadrangulations
- More on the O(n) model on random maps via nested loops: loops with bending energy
- Blocked edges on Eulerian maps and mobiles: Application to spanning trees, hard particles and the Ising model
- Statistics of planar graphs viewed from a vertex: A study via labeled trees
- An Analytical Analysis of CDT Coupled to Dimer-like Matter
- Geometrically constrained statistical systems on regular and random lattices: From folding to meanders
- Planar maps and continued fractions
- Combinatorics of bicubic maps with hard particles
- Frustration effects in antiferromagnets on planar random graphs
- Spanning forests in regular planar maps
- Combinatorics of Hard Particles on Planar Graphs
- Knot Probabilities in Random Diagrams
- On the diameter of random planar graphs
- Bounds on the critical line via transfer matrix methods for an Ising model coupled to causal dynamical triangulations
- Gravity Effects on Information Filtering and Network Evolving
- Integrability of graph combinatorics via random walks and heaps of dimers
- Critical Behaviour of Spanning Forests on Random Planar Graphs
- A Diagrammatic Equation for Oriented Planar Graphs
- A Free-Algebraic Solution for the Planar Approximation
- Potts model coupled to causal triangulations
- Maps of unfixed genus and blossoming trees
- Dynamic Space Filling
- On the planar free energy of matrix models
- Multicritical continuous random trees