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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
