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)- Spanning forests in regular planar maps
- Blossoming bijection for higher-genus maps
- Random matrices, graphical enumeration and the continuum limit of Toda lattices
- Unified bijections for maps with prescribed degrees and girth
- Planar maps and continued fractions
- Multicritical continuous random trees
- The three-point function of planar quadrangulations
- Liouville quantum gravity and KPZ
- A bijection for triangulations, quadrangulations, pentagulations, etc.
- On the diameter of random planar graphs
- The enumeration of planar graphs via Wick's theorem
- The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
- Bounds on the critical line via transfer matrix methods for an Ising model coupled to causal dynamical triangulations
- Enumeration of Eulerian and unicursal planar maps
- Universality and asymptotics of graph counting problems in non-orientable surfaces
- Geodesic distance in planar graphs
- Integrability of graph combinatorics via random walks and heaps of dimers
- Bijective proof of the rationality of the generating series of higher-genus maps
- A free-algebraic solution for the planar approximation
- Topological expansion of unitary integrals and maps
- Combinatorics of bicubic maps with hard particles
- A simple formula for the series of constellations and quasi-constellations with boundaries
- Random surfaces and lattice Yang-Mills
- Maps of unfixed genus and blossoming trees
- Counting coloured planar maps
- A bijection for triangulations of a polygon with interior points and multiple edges
- Geodesic distance in planar graphs: an integrable approach
- Potts model coupled to random causal triangulations
- The slice decomposition of planar hypermaps
- A diagrammatic equation for oriented planar graphs
- A bijection for nonorientable general maps
- On the planar free energy of matrix models
- Combinatorial aspects of matrix models
- Statistics of planar graphs viewed from a vertex: A study via labeled trees
- The six-vertex model on random planar maps revisited
- A generic method for bijections between blossoming trees and planar maps
- Counting non-planar diagrams: An exact formula
- Critical behaviour of spanning forests on random planar graphs
- Planar maps
- Analyticity of the planar limit of a matrix model
- Enumeration of unrooted odd-valent regular planar maps
- A note on enumeration of one-vertex maps
- Rectangular matrix models and combinatorics of colored graphs
- A noncommutative enumeration problem
- Combinatorics of hard particles on planar graphs
- Counting colored planar maps: algebraicity results
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
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)
