Counting the number of round-robin tournament schedules
DOI10.4171/EM/296zbMATH Open1345.05039MaRDI QIDQ301476FDOQ301476
Authors: Alyssa Cherry, Drake Olejniczak, Qinghong Zhang 
Publication date: 30 June 2016
Published in: Elemente der Mathematik (Search for Journal in Brave)
Full work available at URL: http://www.ems-ph.org/journals/show_pdf.php?vol=71&iss=1&issn=0013-6018&rank=3
Recommendations
- Counting tournament brackets
- Counting tournament score sequences
- Round-robin tournaments with homogeneous rounds
- scientific article; zbMATH DE number 4196016
- scientific article; zbMATH DE number 4156488
- On the organization of round robin tournaments with constraints
- scientific article; zbMATH DE number 7732125
- Scheduling partial round robin tournaments subject to home away pattern sets
- Round robin tournaments and three index assignments
- Integer programming models for round Robin tournaments
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Exact enumeration problems, generating functions (05A15) Graph polynomials (05C31) Enumeration in graph theory (05C30)
Cited In (5)
- On the score sheets of a round-robin football tournament
- Applying the diamond product of graphs to the round robin tournament scheduling problem
- Feasibility of home-away-pattern sets for round robin tournaments
- Round-robin tournaments generated by the circle method have maximum carry-over
- The number of tournaments with the minimum number of upsets
Uses Software
This page was built for publication: Counting the number of round-robin tournament schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301476)
