Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Counting the number of round-robin tournament schedules

From MaRDI portal
Publication:301476
Jump to:navigation, search

DOI10.4171/EM/296zbMath1345.05039MaRDI QIDQ301476

Drake Olejniczak, Qinghong Zhang, Alyssa Cherry

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


zbMATH Keywords

schedulingtournamentsround-robin algorithmtournament schedules


Mathematics Subject Classification ID

Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)



Uses Software

  • Maple



This page was built for publication: Counting the number of round-robin tournament schedules

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:301476&oldid=12185353"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki