Some new triplewhist tournaments TWh(\(v\)). (English) Zbl 1061.05018
The authors complete the solution to the problem of existence of triplewhist tournaments \(\text{TWh}(4n)\) on \(4n\) elements by showing that there is no tournament for \(4n=12\) and constructing \(Z\)-cyclic tournaments for \(4n=44,48,52\) and 56. They also construct a \(Z\)-cyclic TWh(45), and these new cyclic designs are then used to obtain an improvement on the existence results of G. Ge and L. Zhu [Bull. Inst. Comb. Appl. 32, 53–62 (2001; Zbl 0978.05019)].
Reviewer: Ian Anderson (MR 2003j:05034)
Citations:
Zbl 0978.05019Online Encyclopedia of Integer Sequences:
Numbers k such that a triplewhist tournament TWh(k) exists.References:
| [1] | Anderson, I., A hundred years of whist tournaments, JCMCC, 19, 129-150 (1995) · Zbl 0855.05013 |
| [2] | Anderson, I.; Finizio, N., Triplewhist tournaments that are also Mendelsohn designs, J. Combin. Des., 5, 397-406 (1997) · Zbl 0914.05007 |
| [3] | Anderson, I.; Finizio, N.; Leonard, P., New Product theorems for \(Z\)-cyclic whist tournaments, J. Combin. Theory, Series A, 88, 162-166 (1999) · Zbl 0935.05009 |
| [4] | Attinger, L.; Leonard, P., New families of \(Z\)-cyclic triplewhist tournaments, Congr. Numer., 133, 163-169 (1998) · Zbl 0952.05008 |
| [5] | R.D. Baker, Factorization of graphs, Doctoral Thesis, Ohio State University, 1975.; R.D. Baker, Factorization of graphs, Doctoral Thesis, Ohio State University, 1975. |
| [6] | Beth, T.; Jungnickel, D.; Lenz, H., Design Theory (1986), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0602.05001 |
| [7] | Buratti, M., Existence of \(Z\)-cyclic triplewhist tournaments for a prime number of players, J. Combin. Theory, Series A, 90, 315-325 (2000) · Zbl 0960.05016 |
| [8] | Buratti, M.; Zuanni, F., Perfect Cayley designs as generalizations of perfect Mendelsohn designs, Des. Codes Crypt., 23, 233-247 (2001) · Zbl 0989.05016 |
| [9] | Colbourn, C. J.; De Launey, W., Difference matrices, (Colbourn, C. J.; Dinitz, J. H., CRC Handbook of Combinatorial Designs (1996), CRC Press: CRC Press Boca Raton, FL), 287-297 · Zbl 0858.05022 |
| [10] | Finizio, N., \(Z\)-cyclic triplewhist tournaments—the non-compatible case, Part 1, J. Combin. Des., 3, 135-146 (1995) · Zbl 0886.05022 |
| [11] | Finizio, N., \(Z\)-cyclic triplewhist tournaments—the non-compatible case, Part 2, J. Combin. Des., 5, 189-201 (1997) · Zbl 0911.05010 |
| [12] | Finizio, N.; Merritt, A., Further results on \(Z\)-cyclic triplewhist tournaments, Utilitas Math., 55, 17-32 (1999) · Zbl 0949.05013 |
| [13] | Finizio, N.; Merritt, A., \(Z\)-cyclic triplewhist tournaments—some exceptional cases, Congr. Numer., 131, 19-34 (1998) · Zbl 0951.05009 |
| [14] | Ge, G.; Zhu, L., Frame constructions for \(Z\)-cyclic triplewhist tournaments, Bull. I.C.A., 32, 53-62 (2001) · Zbl 0978.05019 |
| [15] | H. Haanpää, P.R.J. Östergård, Classification of whist tournaments with up to twelve players, preprint.; H. Haanpää, P.R.J. Östergård, Classification of whist tournaments with up to twelve players, preprint. · Zbl 1029.05017 |
| [16] | Liaw, Y. S., Construction of \(Z\)-cyclic triple whist tournaments, J. Combin. Des., 4, 219-233 (1996) · Zbl 0911.05011 |
| [17] | Lu, Y.; Zhu, L., On the existence of triplewhist tournaments \(TWh (v)\), J. Combin. Des., 5, 249-256 (1997) · Zbl 0913.05013 |
| [18] | Mills, W. H., Some mutually orthogonal Latin squares, Congr. Numer., 19, 473-487 (1977) · Zbl 0411.05017 |
| [19] | Moore, E. H., Tactical memoranda I-III, Amer. J. Math., 18, 264-303 (1896) · JFM 27.0472.02 |
| [20] | Morales, L. B.; Velarde, C., A complete classification of (12,4,3)-RBIBDs, J. Combin. Des., 9, 385-400 (2001) · Zbl 0994.05027 |
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.
