Simple tournaments and sharply transitive groups
✍ Scribed by Wilfried Imrich; Jaroslav Nešetřil
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 486 KB
- Volume
- 108
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We prove that with the possible exception of total orders every tournament with sharply transitive group of automorphisms is simple.
📜 SIMILAR VOLUMES
## Abstract A simple proof is given for a result of Sali and Simonyi on self‐complementary graphs. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 111–112, 2001
Let ⌫ be a finite connected regular graph with vertex set V ⌫, and let G be a subgroup of its automorphism group Aut ⌫. Then ⌫ is said to be G-locally primiti¨e if, for each vertex ␣ , the stabilizer G is primitive on the set of vertices adjacent to ␣ ␣. In this paper we assume that G is an almost s
## AstiC-Vidal, A. and V. Dugat, Near-homogeneous tournaments and permutation groups, Discrete Mathematics 102 (1992) 111-120.