The asymptotic number of tree-rooted maps on a surface (Q1102304): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Errata: Asymptotic Methods in Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of rooted maps on a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting rooted maps by genus. I / rank
 
Normal rank

Latest revision as of 16:08, 18 June 2024

scientific article
Language Label Description Also known as
English
The asymptotic number of tree-rooted maps on a surface
scientific article

    Statements

    The asymptotic number of tree-rooted maps on a surface (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    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.
    0 references
    tree rooted maps
    0 references
    asymptotic enumeration
    0 references

    Identifiers