Near-homogeneous tournaments and permutation groups (Q1193708): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4103557 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path Partitions in Directed Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5588447 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Doubly regular tournaments are equivalent to skew Hadamard matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3872493 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Caracterisation Des Tournois Presqu'Homogenes / rank | |||
Normal rank |
Revision as of 13:21, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Near-homogeneous tournaments and permutation groups |
scientific article |
Statements
Near-homogeneous tournaments and permutation groups (English)
0 references
27 September 1992
0 references
A tournament \(T_ n\) is near-homogeneous if \(n=4\lambda+1\), \(\lambda\geq 1\), and any arc belongs to \(\lambda\) or \(\lambda+1\) 3-cycles. The authors investigate vertex-symmetric tournaments with two arc orbits; among such tournaments of prime order less than 1000, they have found six new near- homogeneous tournaments of orders 29, 53, 173, 229, 293, and 733.
0 references
vertex-symmetric tournaments
0 references
near-homogeneous tournaments
0 references
permutation group
0 references