
Accession Number : AD0687472
Title : VERY REGULAR TOURNAMENTS.
Descriptive Note : Technical rept.,
Corporate Author : DELAWARE UNIV NEWARK DEPT OF MATHEMATICS
Personal Author(s) : Remage,Russell , Jr
Report Date : MAY 1969
Pagination or Media Count : 31
Abstract : In the set of all (roundrobin) 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)
Descriptors : (*GRAPHICS, *GROUPS(MATHEMATICS)), NUMBER THEORY, LINEAR PROGRAMMING, COMBINATORIAL ANALYSIS, SET THEORY, THEOREMS
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE