Upsets in round robin tournaments

Abstract LetT( R ) be the class of tournaments having monotone score vector R = (r 1 ,…, r n ) . For a given n , upper and lower bounds are given for the minimum number and maximum number of upsets for tournaments inT( R ) with R strong. The cases of equality are characterized.