Abstract
AbstractWe introduce a large class of tournament properties, all of which are shared by almost all random tournaments. These properties, which we term “quasi‐random,” have the property that tournaments possessing any one of the properties must of necessity possess them all. In contrast to random tournaments, however, it is often very easy to verify that a particular family of tournaments satisfies one of the quasi‐random properties, thereby giving explicit tournaments with “random‐like” behavior. This paper continues an approach initiated in several earlier papers of the authors where analogous results for graphs (with R.M. Wilson) and hypergraphs are proved.
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.
