An upper bound for the average number of regions (Q1124599)

From MaRDI portal
Revision as of 10:26, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An upper bound for the average number of regions
scientific article

    Statements

    An upper bound for the average number of regions (English)
    0 references
    0 references
    1991
    0 references
    A probabilistic argument is used to obtain an upper bound on the mean of the region distribution of an arbitrary graph. This result, which is fairly sharp, though in all likelihood not best possible, is strong enough to imply that the average genus of the complete graph is asymptotic, in ratio, to its maximum genus.
    0 references
    0 references
    orientable embeddings
    0 references
    probabilistic argument
    0 references
    upper bound
    0 references
    mean of the region distribution
    0 references
    arbitrary graph
    0 references
    average genus
    0 references
    maximum genus
    0 references

    Identifiers