Balanced tournament designs and related topics

DOI10.1016/0012-365X(89)90358-0MaRDI QIDQ1823946zbMATH OpenOpenAlexFDO

Authors Scott A. Vanstone, Esther R. Lamken

Publication date 1989

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(89)90358-0

zbMATH Keywords

Balanced Tournament DesignsBTDresolvable BIBDroom square designround robin tournaments

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Directed graphs (digraphs), tournaments (05C20)

Review text

This is an excellent review paper on the topic of Balanced Tournament Designs. A balanced tournament design of order n, BTD(n), is an \(n\times (2n-1)\) array defined on a set of 2n elements V such that (1) each cell of the array contains a pair of distinct elements from V, (2) every pair of distinct elements from V is contained in some cell, (3) each element is contained in each column, and (4) no element is contained in more than 2 cells of each row. As is well known by now, the existence of such designs has been completely settled. All the crucial theorems are reviewed and various extensions and generalizations are presented. Close connections with other combinatorial systems are also pointed out, such as Room squares, Kotzig factorizations in graph theory, resolvable balanced incomplete block designs, Kirkman squares, etc. All in all, highly recommended reading for researchers in combinatorial designs.

Recommendations

• scientific article; zbMATH DE number 874502
• Generalized Balanced Tournament Designs
• scientific article; zbMATH DE number 653266
• On near generalized balanced tournament designs
• scientific article; zbMATH DE number 6695
• scientific article; zbMATH DE number 4066928
• Constructions for generalized balanced tournament designs
• The existence of court balanced tournament designs
• scientific article; zbMATH DE number 1109409
• The existence of near generalized balanced tournament designs

Cites work

• A doubly divisible nearly Kirkman system
• A Tournament Design Problem
• Balanced tournament designs and resolvable (v,3,2)-BIBDs
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Constructions for generalized balanced tournament designs
• Doubly resolvable designs
• Existence results for doubly near resolvable \((v,3,2)\)-BIBDs
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• scientific article; zbMATH DE number 3933095 (Why is no real title available?)
• scientific article; zbMATH DE number 3935052 (Why is no real title available?)
• scientific article; zbMATH DE number 3935053 (Why is no real title available?)
• scientific article; zbMATH DE number 3968600 (Why is no real title available?)
• scientific article; zbMATH DE number 3968601 (Why is no real title available?)
• scientific article; zbMATH DE number 4045759 (Why is no real title available?)
• scientific article; zbMATH DE number 4045760 (Why is no real title available?)
• scientific article; zbMATH DE number 4051638 (Why is no real title available?)
• scientific article; zbMATH DE number 4055630 (Why is no real title available?)
• scientific article; zbMATH DE number 4085703 (Why is no real title available?)
• scientific article; zbMATH DE number 4093471 (Why is no real title available?)
• scientific article; zbMATH DE number 3771615 (Why is no real title available?)
• scientific article; zbMATH DE number 3485815 (Why is no real title available?)
• scientific article; zbMATH DE number 3494466 (Why is no real title available?)
• scientific article; zbMATH DE number 3563140 (Why is no real title available?)
• scientific article; zbMATH DE number 3590280 (Why is no real title available?)
• scientific article; zbMATH DE number 3621745 (Why is no real title available?)
• scientific article; zbMATH DE number 6695 (Why is no real title available?)
• scientific article; zbMATH DE number 3797764 (Why is no real title available?)
• scientific article; zbMATH DE number 3392464 (Why is no real title available?)
• Kotzig Factorizations: Existence and Computational Results
• On resolvable balanced incomplete block designs
• One-factorizations of the complete graph—A survey
• Orthogonal resolutions in odd balanced tournament designs
• The construction of Kotzig factorizations
• The existence of orthogonal resolutions of lines in AG(n,q)
• The existence of Room squares

Cited in

(15)

• Existence results for generalized balanced tournament designs with block size 3
• Constructions for generalized balanced tournament designs
• The existence of court balanced tournament designs
• How to design a multi-stage tournament when some results are carried over?
• Designing Multiperson Tournaments with Asymmetric Contestants: An Experimental Study
• Generalized Balanced Tournament Designs
• scientific article; zbMATH DE number 3933095 (Why is no real title available?)
• scientific article; zbMATH DE number 1284199 (Why is no real title available?)
• scientific article; zbMATH DE number 1109409 (Why is no real title available?)
• Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
• Construction of orthogonal starters and corollaries
• A simulation comparison of tournament designs for the World Men's Handball Championships
• Construction of Hamilton path tournament designs
• Guest editorial: Special issue in honor of Scott A. Vanstone
• On the existence of sports schedules with multiple venues

This page was built for publication: Balanced tournament designs and related topics

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