Abstract
We prove that the number oft-wise balanced designs of ordern is asymptotically\(n\left( {(_t^n )/(t + 1)} \right)(1 + o(1))\), provided that blocks of sizet are permitted. In the process, we prove that the number oft-profiles (multisets of block sizes) is bounded below by\(\exp \left( {c_1 = \sqrt n \log n} \right)\) and above by\(\exp \left( {c_2 = \sqrt n \log n} \right)\) for constants c2>c1>0.
This is a preview of subscription content, access via your institution.
References
- [1]
V. E. Aleksejev: On the number of Steiner triple systems,Math. Notes 15 (1974), 461–464.
- [2]
C. J. Colbourn, K. T. Phelps, andV. Rödl: Block sizes in pairwise balanced designs,Canadian Math. Bull. 27 (1984), 375–380.
- [3]
P. Erdős: Problems and results on block designs and set systems,Proc. Thirteenth Southeastern Conf. Combinatorics, Graph Theory and Computing,1982, pp. 3–18.
- [4]
H. Lenz: On the number of Steiner quadruple systems,Mitt. Math. Sem. Giessen 169 (1985), 55–71.
- [5]
K. T. Phelps: On the number of commutative Latin squares,Ars Combinatoria 10 (1980), 311–322.
- [6]
V. Rödl: On a packing and covering problem,European J. Combinatorics,5 (1985), 69–78.
- [7]
R. M. Wilson: Nonisomorphic Steiner triple systems,Math. Z. 135 (1974), 303–313.
Author information
Affiliations
Rights and permissions
About this article
Cite this article
Colbourn, C.J., Hoffman, D.G., Phelps, K.T. et al. The number oft-wise balanced designs. Combinatorica 11, 207–218 (1991). https://doi.org/10.1007/BF01205073
Received:
Issue Date:
AMS subject classification (1980)
- 05 B 30
- 05 B 05