The Hadwiger number of infinite vertex-transitive graphs
β Scribed by Carsten Thomassen
- Publisher
- Springer-Verlag
- Year
- 1992
- Tongue
- English
- Weight
- 679 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Let __n__ be an integer and __q__ be a prime power. Then for any 3 β€ __n__ β€ __q__β1, or __n__=2 and __q__ odd, we construct a connected __q__βregular edgeβbut not vertexβtransitive graph of order 2__q__^__n__+1^. This graph is defined via a system of equations over the finite field of
The maximum genus of all vertex-transitive graphs is computed. It is proved that a k-valent vertex-transitive graph of girth g is upper-embeddable whenever k 3 4 or g 2 4. Non-upper-embeddable vertex-transitive graphs are characterized. A particular attention is paid to Cayley graphs. Groups for wh
Let G be a group acting symmetrically on a graph 2, let G, be a subgroup of G minimal among those that act symmetrically on 8, and let G2 be a subgroup of G, maximal among those normal subgroups of GI which contain no member except 1 which fixes a vertex of Z. The most precise result of this paper i