Geodesic distance in planar graphs: an integrable approach

DOI10.1007/s11139-005-4845-yzbMath1079.05040arXivmath/0506543OpenAlexW2117234194MaRDI QIDQ2583521

Yanyan Li

Publication date: 17 January 2006

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0506543

zbMATH Keywords

generating functionsintegrable systemssolitonsenumeration

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Enumeration in graph theory (05C30) Distance in graphs (05C12)

Related Items (6)

On the two-point function of general planar maps and hypermaps ⋮ Planar maps and continued fractions ⋮ Fighting fish: enumerative properties ⋮ Integrability of graph combinatorics via random walks and heaps of dimers ⋮ The skeleton of the UIPT, seen from infinity ⋮ Multi-point functions of weighted cubic maps

Cites Work

• Counting colored random triangulations
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Solitons and infinite dimensional Lie algebras
• Geodesic distance in planar graphs
• Random planar lattices and integrated superBrownian excursion
• Scaling in quantum gravity
• Enumeration of planar constellations
• Planar diagrams
• Combinatorics of hard particles on planar graphs
• On the fractal structure of two-dimensional quantum gravity
• Exact solution of the \(O(n)\) model on a random lattice
• A Census of Planar Triangulations
• Random trees between two walls: exact partition function

This page was built for publication: Geodesic distance in planar graphs: an integrable approach