Abstract
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we show that all of these designs are indecomposable and therefore they do not lead to large sets of 5-(14,6,3) designs. Moreover, they provide the first counterexamples for a conjecture on disjoint t-designs which states that if there exists a t-(v, k, λ) design (X, D) with minimum possible value of λ, then there must be a t-(v, k, λ) design (X, D′) such that D∩ D′ = Ø.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. E. Brouwer, Table of t-designs without repeated blocks, 2 ≤ t ≤ k ≤ v/2, λ ≤ λ +/2, Math. Centrum. Report ZN76, Amsterdam (1977); unpublished update (1986).
B. Ganter, J. Pelikan and L. Teirlinck, Small sprawling systems of equicardinal sets, Ars Combinatoria, Vol. 4 (1977) pp. 133–142.
A. S. Hedayat, G. B. Khosrovshahi and D. Majumdar, A prospect for a general method of constructing t-designs, Discrete Appl. Math., Vol. 42 (1993) pp. 31–50.
M. Mohammad-Noori and B. Tayfeh-Rezaie, Backtracking algorithm for finding t-designs, J. Combin. Des., Vol. 11 (2003) pp. 240–248.
R. M. Wilson, A diagonal form for the incidence matrices of t-subsets vs. k-subsets, European J. Combin., Vol. 11 (1990) pp. 609–615.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Khosrovshahi, G.B., Tayfeh-Rezaie, B. Some Indecomposable t-Designs. Designs, Codes and Cryptography 32, 235–238 (2004). https://doi.org/10.1023/B:DESI.0000029226.07366.dd
Issue Date:
DOI: https://doi.org/10.1023/B:DESI.0000029226.07366.dd