This is the story of what happens when a young businessman, condemned to death for a crime he was not aware of, and contemplating suicide, meets a young woman who travels via skateboard and whose life has all the normalcy of an AA meeting. With a death sentence of AIDS hovering in the background, Er
Almost All Maps Are Asymmetric
β Scribed by L.B. Richmond; N.C. Wormald
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 291 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
β¦ Synopsis
We give a simple proof of the fact that for a wide variety of classes of maps on surfaces, almost all maps in the class are asymmetric. Our method is based on recent results on the appearance of submaps in the classes. 'c. 1995 Academic Press, Inc.
π SIMILAR VOLUMES
An undirected graph G is called a comparability graph if there exists an orientation of its edges such that the resulting relation on its vertex set is a partial order P. A comparability graph is UPO (i.e. uniquely partially orderable) if, except for its dual p-x, there is only one such partial orde
Maps are frequently used to display spatial distributions of parameters of interest, such as cancer rates or average pollutant concentrations by county. It is well known that plotting observed rates can have serious drawbacks when sample sizes vary by area, since very high (and low) observed rates a