2025/01/20 by Jonathan A. Noel, Noel, Jonathan A., Arjun Ranganathan +3
Computer Science · Decision Sciences · #05C20 #05C50 #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics #Game Theory and Applications
paper · pdf · doi:10.48550/arxiv.2501.11675
openalex publication_date 2025/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
A tournament H is said to force quasirandomness if it has the property that a sequence (Tn)n∈ ℕ of tournaments of increasing orders is quasirandom if and only if the homomorphism density of H in Tn tends to (1/2)^\binomv(H)2 as n→∞. It was recently shown that there is only one non-transitive tournament with this property. This is in contrast to the analogous problem for graphs, where there are numerous graphs that are known to force quasirandomness and the well known Forcing Conjecture suggests that there are many more. To obtain a richer family of characterizations of quasirandomness in tournaments, we propose a variant in which the tournaments (Tn)n∈ ℕ are assumed to be "nearly regular." We characterize the tournaments on at most 5 vertices which force quasirandomness under this stronger assumption.