A generalization of rotational tournaments
type: Item
instance of: scholarly article
title: A generalization of rotational tournaments
zbMATH Open document ID: 0672.05034
DOI: 10.1016/0012-365X(89)90301-4
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: An (n,r)-tournament is a set of n vertices such that the vertices in each of the \(\left( \begin{matrix} n\\ r\end{matrix} \right)\) subsets of size r have been assigned one of the r! possible orderings. Such a tournament is rotational if it has an automorphism which permutes the vertices in a cycle of length n. The authors show that if \(n\geq r\geq 2\) then there exists a rotational (n,r)-tournament if and only if \(g.c.d.(n,r)=1\).
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 4099333
zbMATH Keywords: rotational tournaments
zbMATH Keywords: (n,r)-tournament
author: Erol Barbut
author: Arie Bialostocki
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: An application of the Ramsey theorem to ordered r-tournaments
cites work: What must be contained in every oriented k-uniform hypergraph
cites work: Q3680857
description: scientific article; zbMATH DE number 4099333