Abstract
A defining set of a t-(v, k, λ) design is a subcollection of the block set of the design which is not contained in any other design with the same parameters. A defining set is said to be minimal if none of its proper subcollections is a defining set. A defining set is said to be smallest if no other defining set has a smaller cardinality. A t-(v, k, λ) design \({D = (V, \fancyscript{B})}\) is called a full design if \({\fancyscript{B}}\) is the collection of all possible k-subsets of V. Every simple t-design is contained in a full design and the intersection of a defining set of a full design with a simple t-design contained in it, gives a defining set of the corresponding t-design. With this motivation, in this paper, we study the full designs when t = 2 and k = 3 and we give several families of non-isomorphic minimal defining sets of full designs. Also, it is proven that there exist values in the spectrum of the full design on v elements such that the number of non-isomorphic minimal defining sets on each of these sizes goes to infinity as v→ ∞. Moreover, the lower bound on the size of the defining sets of the full designs is improved by finding the size of the smallest defining sets of the full designs on eight and nine points. Also, all smallest defining sets of the full designs on eight and nine points are classified.
Similar content being viewed by others
References
Curtis R.T.: Eight octads suffice. J. Combin. Theory (Ser. A) 36, 116–123 (1984)
Gray K.: On the minimum number of blocks defining a design. Bull. Aust. Math. Soc. 41, 97–112 (1990)
Seberry J., Street A.P.: Strongbox secured secret sharing schemes. Util. Math. 57, 147–163 (2000)
Donovan, D.M., Mahmoodian, E.S., Ramsay, C., Street, A.P.: Defining sets in combinatorics: a survey. In: Wensley, C.D. (ed.) Surveys in Combinatorics, pp. 115–174. Cambridge University Press, Cambridge (2003)
Gray K., Street A.P.: On defining sets of full designs and of designs related to them. J. Combin. Math. Combin. Comput. 60, 97–104 (2007)
Donovan D., Lefevre J., Waterhouse M., Yazıcı E.Ş.: On defining sets of full designs with block size three. Graphs Combin. 25, 825–839 (2009)
Donovan D., Lefevre J., Waterhouse M., Yazıcı E.Ş.: Defining sets of full designs with block size three II. Ann. Combin. 16, 507–515 (2012)
Havas G., Lawrence J.L., Ramsay C., Street A.P., Yazıcı E.Ş.: Defining set spectra for designs can have arbitrarily large gaps. Util. Math. 75, 67–81 (2008)
Kolotoğlu E., Yazıcı E.Ş.: On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of t-designs. Graphs Combin. 26, 259–281 (2010)
Akbari S., Maimani H.R., Maysoori Ch.: Minimal defining sets for full 2−(v, 3, v−2) designs. Aust. J. Combin. 23, 5–8 (2001)
Gray K., Street A.P.: Constructing defining sets of full designs. Util. Math. 76, 91–99 (2008)
Khodkar A.: Smallest defining sets for the 36 non-isomorphic twofold triple systems of order nine. J. Combin. Math. Combin. Comput. 17, 209–215 (1995)
ILOG CPLEX Callable Library, IBM Corporation, 1987–2009
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by TUBITAK CAREER GRANT 106T574.
Rights and permissions
About this article
Cite this article
Demirkale, F., Yazıcı, E.Ş. On The Spectrum of Minimal Defining Sets of Full Designs. Graphs and Combinatorics 30, 141–157 (2014). https://doi.org/10.1007/s00373-012-1256-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1256-x