Census of planar maps: From the one-matrix model solution to a combinatorial proof
From MaRDI portal
(Redirected from Publication:701544)
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.
Recommendations
Cites work
- A Census of Hamiltonian Polygons
- A Census of Planar Maps
- A Census of Planar Triangulations
- A Census of Slicings
- Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
- Coloring random triangulations
- Counting colored random triangulations
- Critical and tricritical hard objects on bicolourable random lattices: exact solutions
- Eigenvalue distribution of large random matrices, from one matrix to several coupled matrices
- Enumeration of planar constellations
- Planar diagrams
Cited in
(47)- The enumeration of planar graphs via Wick's theorem
- Geodesic distance in planar graphs
- Statistics of planar graphs viewed from a vertex: A study via labeled trees
- Enumeration of Eulerian and unicursal planar maps
- Rectangular matrix models and combinatorics of colored graphs
- Combinatorics of hard particles on planar graphs
- A bijection for triangulations of a polygon with interior points and multiple edges
- Analyticity of the planar limit of a matrix model
- Maps of unfixed genus and blossoming trees
- On the planar free energy of matrix models
- Counting colored planar maps: algebraicity results
- Blossoming bijection for higher-genus maps
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Geodesic distance in planar graphs: an integrable approach
- Bijective proof of the rationality of the generating series of higher-genus maps
- The six-vertex model on random planar maps revisited
- A bijection for nonorientable general maps
- Planar maps
- Critical behaviour of spanning forests on random planar graphs
- Combinatorial aspects of matrix models
- A note on enumeration of one-vertex maps
- A simple formula for the series of constellations and quasi-constellations with boundaries
- Unified bijections for maps with prescribed degrees and girth
- Potts model coupled to random causal triangulations
- Combinatorics of bicubic maps with hard particles
- A generic method for bijections between blossoming trees and planar maps
- Spanning forests in regular planar maps
- Integrability of graph combinatorics via random walks and heaps of dimers
- Multicritical continuous random trees
- Counting coloured planar maps
- 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
- The three-point function of planar quadrangulations
- Counting non-planar diagrams: An exact formula
- A diagrammatic equation for oriented planar graphs
- Liouville quantum gravity and KPZ
- A bijection for triangulations, quadrangulations, pentagulations, etc.
- Enumeration of unrooted odd-valent regular planar maps
- Planar maps and continued fractions
- A noncommutative enumeration problem
- Topological expansion of unitary integrals and maps
- Random surfaces and lattice Yang-Mills
- The slice decomposition of planar hypermaps
- A free-algebraic solution for the planar approximation
- Random matrices, graphical enumeration and the continuum limit of Toda lattices
- The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
- Universality and asymptotics of graph counting problems in non-orientable surfaces
This page was built for publication: Census of planar maps: From the one-matrix model solution to a combinatorial proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701544)
