Near-homogeneous tournaments and permutation groups
✍ Scribed by Annie Astié-Vidal; Vincent Dugat
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 567 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
AstiC-Vidal,
A. and V. Dugat, Near-homogeneous tournaments and permutation groups, Discrete Mathematics 102 (1992) 111-120.
📜 SIMILAR VOLUMES
We prove that with the possible exception of total orders every tournament with sharply transitive group of automorphisms is simple.
A G-loop is a loop which is isomorphic to all its loop isotopes. We apply some theorems about permutation groups to get information about G-loops. In particular, we study G-loops of order pq, where p < q are primes and p q -1 . In the case p = 3, the only G-loop of order 3q is the group of order 3q.
## Abstract A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, Cameron and Nešetřil introduced a relaxed version of homogeneity: we say that a structure is homomorphism‐homogeneous if every homo