Abstract
A design is a pair (X,B) where X is a finite set of points and B is a family of not necessarily distinct- subsets Bi (called blocks) of X.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bose, R.C., E.T. Parker & S.S. Shrikhande, Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler’s conjecture, Canad. J. Math., 12 (1960) 189–203.
Bose, R.C. & S.S. Shrikhande, On the construction of sets of mutually orthogonal Latin squares and the falsity of a conjecture of Euler. Trans. Amer. Math. Soc., 95 (1960) 191–209.
Chowla, S., P. Erdös & E.G. Strauss, On the maximal number of pairwise orthogonal Latin squares of a given order, Canad. J. Math., 12 (1960) 204–208.
Dulmage, A.L., D.M. Johnson & N.S. Mendelsohn, Orthomorphisms of groups and orthogonal Latin squares, I, Canad. J. Math., 13 (1961) 356–372.
Hanani, H., On the number of orthogonal Latin squares, J. Combinatorial Theory, 8 (1970) 247–271.
MacNeish, H.F., Euler squares, Ann. of Math., 23 (1922) 221–227.
Parker, E., Construction of some sets of mutually orthogonal Latin squares, Proc. Amer. Math. Soc., 10 (1959) 946–949.
Raghavarao, D., Constructions and combinatorial problems in design of experiments, J. Wiley & Sons, New York, 1971.
Rogers, K., A note on orthogonal Latin squares, Pacific J. Math., 14 (1964) 1395–1397.
Wilson, R.M., Concerning the number of mutually orthogonal Latin squares, in print.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Mathematical Centre, Amsterdam
About this paper
Cite this paper
Hanani, H. (1975). On Transversal Designs. In: Hall, M., van Lint, J.H. (eds) Combinatorics. NATO Advanced Study Institutes Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1826-5_3
Download citation
DOI: https://doi.org/10.1007/978-94-010-1826-5_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-1828-9
Online ISBN: 978-94-010-1826-5
eBook Packages: Springer Book Archive