Graphs with automorphism groups admitting composition factors of bounded rank
✍ Scribed by Praeger, Cheryl E.; Pyber, Laszló; Spiga, Pablo; Szabó, Endre
- Book ID
- 125835326
- Publisher
- American Mathematical Society
- Year
- 2012
- Tongue
- English
- Weight
- 221 KB
- Volume
- 140
- Category
- Article
- ISSN
- 0002-9939
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A l-factorization cp of a simple undirected connected graph G is an edge colouring such that each vertex is incident with exactly one edge of each colour. The automorphisms which preserve the colours of all edges constitute a group A,(G, q). We prove every finitely generated group H to be isomorphic
## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun