A Note on Upper Generalized Exponents of Tournaments

Abstract

For any \(n\geq 7\), we prove that there exists a tournament of order \(n\), such that for each pair of distinct vertices there exists a path of length \(2\).