On Retracts of the Random Graph and Their Natural Order
β Scribed by Anthony Bonato
- Publisher
- Springer Vienna
- Year
- 2002
- Tongue
- English
- Weight
- 103 KB
- Volume
- 135
- Category
- Article
- ISSN
- 0026-9255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We obtain an upper bound on the expected number of regions in the randomly chosen orientable embedding of a fixed graph. This bound is ised to show that the average genus of the random graph on __v__ vertices is close to its maximum genus. More specifically, it is proven that the differ
We show that the variance of the number of edges in the random sphere of influence graph built on n i.i.d. sites which are uniformly distributed over the unit cube in R d , grows linearly with n. This is then used to establish a central limit theorem for the number of edges in the random sphere of i