×

Whist tournaments – three person property. (English) Zbl 0793.90111

A whist tournament on \(v\) players, denoted by \(Wh(v)\), is a resolvable \((v,4,3)\)-BIBD such that each block \((a,b,c,d)\) represents a game in which the partnership \(a-c\) opposes the partnership \(b-d\), subject to the conditions that each player partners every other player exactly once and opposes every other player exactly twice. \(Wh(v)\) are known to exist for all \(v\) congruent to \(0,1\pmod 4\), \(v\) greater than or equal to 4. A \(Wh(v)\) is said to have the Three Person Property if the intersection of any two games is at most two (2). Such \(Wh(v)\) can be denoted by \(3P- Wh(v)\). In this paper it is proved that every \(Wh(8)\) and every \(Wh(9)\) is a \(3P-Wh(v)\). Specific examples of \(3p-Wh(v)\) are 12,13,15,20,22,24,25,29, and 30. In addition to these examples theorems are proven which lead to the existence of several infinite classes of \(3p-Wh(v)\).
Many of these theorems are established using known results related to PBDs. On the other hand two theorems of N. S. Mendelsohn [in: Recent Progress Combinatorics, Proc. 3rd Waterloo Conference 1968, 123- 132 (1969; Zbl 0192.333)] are also exploited to produce infinite classes of \(3p-Wh(v)\). The paper also establishes explicit formulas that generate two infinite classes of resolvable perfect \((v,4,1)\)-Mendelsohn Designs.

MSC:

91A46 Combinatorial games
05B05 Combinatorial aspects of block designs
91A10 Noncooperative games

Citations:

Zbl 0192.333
Full Text: DOI

References:

[1] Anderson, I., Combinatorial Designs (1990), Wiley: Wiley New York · Zbl 0691.05002
[2] Baker, R., Whist tournaments, (Proceedings Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (1975), Florida Atlantic University: Florida Atlantic University Boca Raton, FL), 89-100 · Zbl 0327.05029
[3] R.D. Baker and R.M. Wilson, The whist tournament problem of E.H. Moore, unpublished.; R.D. Baker and R.M. Wilson, The whist tournament problem of E.H. Moore, unpublished.
[4] F.E. Bennett and L. Zhu, Conjugate orthogonal latin squares and related structures, Preprint.; F.E. Bennett and L. Zhu, Conjugate orthogonal latin squares and related structures, Preprint. · Zbl 0765.05022
[5] Bose, R. C.; Cameron, J. M., The bridge tournament problem and calibration designs for comparing pairs of objects, J. Res. Nat. Bur. Standards, 69B, 323-332 (1965) · Zbl 0131.36101
[6] Brouwer, A.; Van Rees, G. H.J., More mutually orthogonal Latin squares, Discrete Math., 39, 263-281 (1982) · Zbl 0486.05015
[7] Foster, R. F., Duplicate Whist (1894), Brentano’s: Brentano’s New York
[8] Hartman, A., Resolvable designs, thesis (1978), Technion
[9] Hartman, A., Doubly and orthogonally resolvable quadruple systems, (Lecture Notes in Mathematics, 829 (1979), Springer: Springer New York), 157-164, Combinatorial Mathematics VII · Zbl 0466.05025
[10] Mendelsohn, N. S., Combinatorial designs as models of universal algebras, Proceedings Third Waterloo Conference on Combinatorics, 123-132 (1968) · Zbl 0192.33302
[11] Mitchell, J. T., Duplicate Whist (1897), Ihling Bros., Ampersand, Everard: Ihling Bros., Ampersand, Everard Kalamazoo, MI
[12] Moore, E. H., Tactical Memoranda I-III, Amer. J. Math., 18, 264-303 (1896) · JFM 27.0472.02
[13] (Payne, C. M., Whist, Vol. 1 (1891\2-1892)), 101
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.