Simple tournaments and sharply transitive groups
نویسندگان
چکیده
If the relation E is transitive, i.e., if (x, y) E E and (y, z) E E imply that (x, z) E E, we speak of a transitive tournament or a total order. Clearly (Z, <) is a total order. We tend to visualize tournaments by considering every edge (x, y) E E as an arrow leading from x to y. In this sense every tournament can also be considered as a complete graph in which every edge is oriented in some direction. We shall also say that x dominates y if (x, y) E E and that a subset A of V(T) dominates a subset B of V(T) if every element of A dominates every element of B. The automorphism group of a tournament T will be denoted by Aut T. 1 will denote the unit element of this group, i.e., the identity mapping. We say that Aut T is transitive, if there is a # E Aut T to every pair X, y of elements of V(T) such that +x = y. If @x #x for any $ E Aut T\ { l} and any x E V(T) we call Aut T jixed point free. A transitive fixed free group is also called a sharply transitive group. It is easy to see that Aut(Z, <) is transitive and fixed point free.
منابع مشابه
Sharply 2-transitive sets of permutations and groups of affine projectivities
Using new results on sharply transitive subsets, we determine the groups of projectivities of finite affine planes, apart from (unknown) planes of order 23 or 24. The group of all projectivities of a geometry G is a measure for the complexity of G: this group tends to be rather large if G is far from being a classical geometry. See [PS81] for more information on the role of projectivities in ge...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملPACKING AND DECOMPOSITIONS IN TRANSITIVE TOURNAMENTS – PhD THESIS
In this thesis we shall deal with oriented graphs. The motivation for us is a result by Sali and Simonyi (see also a short proof by Gyárfás) where the existence of the decomposition of transitive tournaments on two isomorphic graphs is shown. In this thesis we start to study a problem of packing in transitive tournaments and we consider decompositions and partitions of transitive tournaments. T...
متن کاملVertex-transitive tournaments of order a product of two distinct primes
In this paper, we begin a classification of the vertex-transitive tournaments of order pq where p and q are distinct odd primes. In particular we characterize the pq-circulant tournaments; see Theorem 4.3. Moreover, we determine 2-closed (in Wielandt’s sense) oddorder transitive permutation groups of degree p and pq by using the classifications of vertextransitive tournaments of order p and pq....
متن کاملOn the non-existence of sharply transitive sets of permutations in certain finite permutation groups
In this short note we present a simple combinatorial trick which can be effectively applied to show the non-existence of sharply transitive sets of permutations in certain finite permutation groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 108 شماره
صفحات -
تاریخ انتشار 1992