Maximally pair separated round robin tournaments: ordering the blocks of a design

zbMATH Open1146.05008MaRDI QIDQ3514486FDOQ3514486

Authors: Brett Stevens 

Publication date: 21 July 2008

Recommendations

• On the separation in 2-period double round robin tournaments with minimum breaks
• On the organization of round robin tournaments with constraints
• Round-robin tournaments with homogeneous rounds
• Round robin scheduling -- a survey
• Scheduling asynchronous round-robin tournaments

zbMATH Keywords

graph decompositionround robin tournamentedge separated design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (13)

• A combinatorial property of the maximum round robin tournament problem
• Rank-One Round Robin Designs
• On the separation in 2-period double round robin tournaments with minimum breaks
• Scheduling asynchronous round-robin tournaments
• Title not available (Why is that?)
• Maximising common fixtures in a round robin tournament with two divisions
• Orderings of finite fields and balanced tournaments
• Round-robin tournaments generated by the circle method have maximum carry-over
• The separation sequence of odd order binary subsets
• Title not available (Why is that?)
• A variant of the round-robin scheduling problem.
• Scheduling CCRR tournaments
• Title not available (Why is that?)

This page was built for publication: Maximally pair separated round robin tournaments: ordering the blocks of a design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514486)