On the asymptotic distributions of subgraph counts in a random tournament

Abstract

A random tournament T-n is obtained by independently orienting the edges of the complete graph on n vertices, with probability 1/2 far each direction. We study the asymptotic distribution, as n ten ...