## Abstract A perfect edge colouring of a graph is defined by the property that all colour matchings are perfect matchings. Every edgeβcoloured graph determines a group of graph automorphisms which preserve the colours of the edges. If the graph is connected, then this group of colour preserving au
A Note on 2-Automorphic 2-Groups
β Scribed by Bettina Wilkens
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 145 KB
- Volume
- 184
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
dedicated to professor helmut wielandt on the occasion of his 90th birthday ## 1. INTRODUCTORY REMARKS Let G be a group and denote by PAut G the group of power automorphisms of G (see [4]). An automorphism of G is called an I-automorphism of G if it maps every infinite subgroup of G onto itself. T
Two celebrated applications of the character theory of finite groups are Burnside's p β£ q β€ -Theorem and the theorem of Frobenius on the groups that bear his name. The elegant proofs of these theorems were obtained at the beginning of this century. It was then a challenge to find character-free proo
Let F be a finitely generated free group, and let n denote its rank. A subgroup H of F is said to be automorphism-fixed, or auto-fixed for short, if there exists a set S of automorphisms of F such that H is precisely the set of elements fixed by every element of S; similarly, H is 1-auto-fixed if th