The Number of Groups of a given Genus
Author:
- T. W. TuckerTTT. W. Tucker
- 1 March 1980
- journal article
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 258 (1) , 167-179
Abstract
It is shown that the number of groups with a given genus greater than one is finite. The proof depends heavily on V. K. Proulx’s classification of groups of genus one. The key observation is that as the number of vertices of a graph imbedded on a given surface increases, the average face size of the imbedding approaches the average face size of a toroidal imbedding. The result appears to be related to Hurwitz’s theorem bounding the order of a group of conformal automorphisms on a Riemann surface of genus g.Keywords
This publication has 6 references indexed in Scilit:
- Classification of the toroidal groupsJournal of Graph Theory, 1978
- Every connected regular graph of even degree is a Schreier coset graphJournal of Combinatorial Theory, Series B, 1977
- Special embeddings of Cayley diagramsJournal of Combinatorial Theory, Series B, 1975
- Voltage graphsDiscrete Mathematics, 1974
- Cayley Diagrams on the Anchor RingAmerican Journal of Mathematics, 1931
- The Representation of Finite Groups, Especially of the Rotation Groups of the Regular Bodies of Three-and Four-Dimensional Space, by Cayley's Color DiagramsAmerican Journal of Mathematics, 1896