The asymptotic number of tree-rooted maps on a surface
From MaRDI portal
(Redirected from Publication:1102304)
This paper gives the asymptotic enumeration of two kinds of maps on a surface S of type g. They are tree rooted maps, in which a spanning tree of edges is distinguished, and tree rooted smooth maps which satisfy the extra condition that no vertices are of degree less than 2.
Recommendations
Cites work
Cited in
(20)- A survey of the asymptotic behaviour of maps
- The asymptotic number of rooted maps on a surface
- The asymptotic number of rooted nonseparable maps on a surface
- Representations of graphs and networks (coding, layouts and embeddings)
- The number of rooted triangular maps on a surface
- The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line
- A pattern for the asymptotic number of rooted maps on surfaces
- The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.
- Le schéma de carte et ses applications
- The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces
- Blossoming bijection for higher-genus maps
- The number of rooted essential maps on surfaces
- Bijective proof of the rationality of the generating series of higher-genus maps
- Topological classification and enumeration of RNA structures by genus
- Énumération des cartes pointées sue la bouteille de Klein
- A bijection for covered maps on orientable surfaces
- Antipodal trees and mutually critical points on surfaces
- A bijection for covered maps, or a shortcut between Harer-Zagiers and Jacksons formulas
- Classification of the genus-1 rooted maps and associated functional relation
- A new combinatorial identity for unicellular maps, via a direct bijective approach
This page was built for publication: The asymptotic number of tree-rooted maps on a surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102304)