Counting Tournaments with a Specified Number of Circular Triads

Abstract

We investigate the counting of tournaments with a specified number of circular triads ($3$-cycles). We derive the generating functions for the sequences of the counts, and give explicit expressions for the sequences for when the number of circular triads is from $0$ through $14$.