Abstract: | It was shown by Babai and Imrich 2] that every finite group of odd order except and admits a regular representation as the automorphism group of a tournament. Here, we show that for k ≥ 3, every finite group whose order is relatively prime to and strictly larger than k admits a regular representation as the automorphism group of a k‐tournament. Our constructions are elementary, suggesting that the problem is significantly simpler for k‐tournaments than for binary tournaments. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 238–248, 2002 |