On the number of 8-cycles for two particular regular tournaments of order N with diametrically opposite local properties
arXiv:2403.07629
Abstract
For a regular tournament of order denote by the number of cycles of length in Let be a doubly-regular tournament of order (so, the out-sets and in-sets of its vertices are also regular and hence, contain the maximum possible number of cyclic triples) and be the unique regular locally transitive tournament of (odd) order (so, the out-sets and in-sets of its vertices are transitive and hence, contain no cyclic triples, at all). Some arguments based on the spectral properties of tournaments allow us to suggest that where is sufficiently large. This restriction on is essential because our computer processing of B. McKay's file of tournaments implies that for the maximum of is attained at tournaments with regular structure of the out and in-sets of their vertices. In the present paper, we show that does not depend on a particular choice of and determine expressions for and They are both polynomials of degree in Comparing with yields the inequality for while for This allows us to treat the value as the point of phase transition in the local properties of maximizers and minimizers of in the class of regular tournaments of order