Cofinality of Regular Tournaments
Omar Hatem, Sara Mohamed, Isabel M\"uller, Daoud Siniora
TL;DR
This paper proves the cofinality of finite regular tournaments within all finite tournaments, explores cofinality in subclasses, and offers an algorithm for constructing such tournaments.
Contribution
It establishes cofinality results for regular tournaments and their subclasses, and introduces an algorithm for their construction.
Findings
Finite regular tournaments are cofinal in all finite tournaments.
Cofinality results are extended to certain subclasses of regular tournaments.
An explicit algorithm for constructing regular tournaments is provided.
Abstract
We show that the class of all finite regular tournaments is cofinal in the class of finite tournaments. In addition, we establish cofinality results for certain special subclasses of regular tournaments. We also provide an algorithm for constructing these regular tournaments.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.