An upper bound for the average number of regions
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.
scientific article; zbMATH DE number 4112616