Census of planar maps: From the one-matrix model solution to a combinatorial proof
From MaRDI portal
Publication:701544
DOI10.1016/S0550-3213(02)00813-1zbMath0999.05052arXivcond-mat/0207682OpenAlexW3099542467MaRDI QIDQ701544
Philippe Di Francesco, Emmanuel Guitter, Jérémie Bouttier
Publication date: 3 November 2002
Published in: Nuclear Physics. B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0207682
Related Items (38)
A bijection for triangulations of a polygon with interior points and multiple edges ⋮ Bijective proof of the rationality of the generating series of higher-genus maps ⋮ Counting coloured planar maps ⋮ A free-algebraic solution for the planar approximation ⋮ Geodesic distance in planar graphs ⋮ A simple formula for the series of constellations and quasi-constellations with boundaries ⋮ Blossoming bijection for higher-genus maps ⋮ A diagrammatic equation for oriented planar graphs ⋮ Potts model coupled to random causal triangulations ⋮ Unified bijections for maps with prescribed degrees and girth ⋮ On the Diameter of Random Planar Graphs ⋮ Analyticity of the planar limit of a matrix model ⋮ A bijection for nonorientable general maps ⋮ Liouville quantum gravity and KPZ ⋮ Critical behaviour of spanning forests on random planar graphs ⋮ Statistics of planar graphs viewed from a vertex: A study via labeled trees ⋮ A bijection for triangulations, quadrangulations, pentagulations, etc. ⋮ Enumeration of unrooted odd-valent regular planar maps ⋮ Random matrices, graphical enumeration and the continuum limit of Toda lattices ⋮ Planar maps and continued fractions ⋮ A noncommutative enumeration problem ⋮ A generic method for bijections between blossoming trees and planar maps ⋮ Spanning forests in regular planar maps ⋮ Bounds on the critical line via transfer matrix methods for an Ising model coupled to causal dynamical triangulations ⋮ The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees ⋮ Polynomial equations with one catalytic variable, algebraic series and map enumeration ⋮ Universality and asymptotics of graph counting problems in non-orientable surfaces ⋮ Counting colored planar maps: algebraicity results ⋮ Maps of unfixed genus and blossoming trees ⋮ Integrability of graph combinatorics via random walks and heaps of dimers ⋮ The enumeration of planar graphs via Wick's theorem ⋮ Enumeration of Eulerian and unicursal planar maps ⋮ Multicritical continuous random trees ⋮ On the planar free energy of matrix models ⋮ The three-point function of planar quadrangulations ⋮ Rectangular matrix models and combinatorics of colored graphs ⋮ Geodesic distance in planar graphs: an integrable approach ⋮ Combinatorics of hard particles on planar graphs
Cites Work
- Counting colored random triangulations
- Eigenvalue distribution of large random matrices, from one matrix to several coupled matrices
- Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
- Coloring random triangulations
- Enumeration of planar constellations
- Planar diagrams
- A Census of Planar Triangulations
- A Census of Hamiltonian Polygons
- A Census of Slicings
- Critical and tricritical hard objects on bicolourable random lattices: exact solutions
- A Census of Planar Maps
This page was built for publication: Census of planar maps: From the one-matrix model solution to a combinatorial proof
