VERY REGULAR TOURNAMENTS.
Abstract
In the set of all (round-robin) tournaments of odd order m, the subset of very regular tournaments consist of those which are regular (have constant score sequence) and have circulant representative matrices. These tournaments are characterized and divided into equivalence classes (structures) in which two are equivalent if they represent the same tournament with different designations and orderings of the nodes. Techniques are developed for determination of the automorphism groups (and thus, all subgroups of the symmetric group Sm containing an element of order m) and for minimum number of upsets, and it is shown that maxima in orders of the automorphism groups and in the minimum number of upsets tend to be realized in very regular tournaments. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1969
- Accession Number
- AD0687472
Entities
People
- Russell Remage Jr
Organizations
- University of Delaware