{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:31:28Z","timestamp":1648935088004},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,2,26]],"date-time":"2010-02-26T00:00:00Z","timestamp":1267142400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00373-010-0892-2","type":"journal-article","created":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T20:21:01Z","timestamp":1267042861000},"page":"259-281","source":"Crossref","is-referenced-by-count":7,"title":["On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs"],"prefix":"10.1007","volume":"26","author":[{"given":"Emre","family":"Koloto\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emine \u015eule","family":"Yaz\u0131c\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,26]]},"reference":[{"key":"892_CR1","first-page":"225","volume":"38","author":"P. Adams","year":"2001","unstructured":"Adams P., Khodkar A., Ramsay C.: Smallest defining sets of some STS(19). J. Combin. Math. Combin. Comput. 38, 225\u2013230 (2001)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"892_CR2","first-page":"5","volume":"23","author":"S. Akbari","year":"2001","unstructured":"Akbari S., Maimani H.R., Maysoori Ch.: Minimal defining sets for full 2-(v, 3, v-2) designs. Austral. J. Combin. 23, 5\u20138 (2001)","journal-title":"Austral. J. Combin."},{"key":"892_CR3","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/0097-3165(72)90104-5","volume":"12","author":"W.O. Alltop","year":"1972","unstructured":"Alltop W.O.: An infinite class of 5-designs. J. Combin. Theory Ser. A 12, 390\u2013395 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"key":"892_CR4","unstructured":"Delaney, C.M.: Computational aspects of defining sets of combinatorial designs. M.Sc Thesis, Department of Mathematics, The University of Queensland (1995)"},{"key":"892_CR5","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Dinitz, J.H.: CRC Handbook of Combinatorial Designs. CRC Publishing Co., Boca Raton (1996), see also http:\/\/www.emba.uvm.edu\/~dinitz\/hcd.html","DOI":"10.1201\/9781420049954"},{"key":"892_CR6","first-page":"115","volume-title":"Surveys in Combinatorics","author":"D.M. Donovan","year":"2003","unstructured":"Donovan D.M., Mahmoodian E.S., Ramsay C., Street A.P.: Defining sets in combinatorics: a survey. In: Wensley, C.D. (eds) Surveys in Combinatorics, pp. 115\u2013174. Cambridge University Press, Cambridge (2003)"},{"key":"892_CR7","first-page":"187","volume":"66","author":"G. Gamble","year":"2004","unstructured":"Gamble G., Maenhaut B.M., Seberry J., Street A.P.: Further results on strongbox secured secret sharing schemes. Util. Math. 66, 187\u2013215 (2004)","journal-title":"Util. Math."},{"key":"892_CR8","unstructured":"Gamble, G.: (Mostly) nests of designs, http:\/\/www.itee.uq.edu.au\/~gregg\/4Anne\/home.html"},{"key":"892_CR9","unstructured":"Gibbons, P.B.: Computing techniques for the construction and analysis of block designs. Ph.D. thesis, University of Toronto (1976)"},{"key":"892_CR10","volume-title":"Combinatorial Identities","author":"H.W. Gould","year":"1972","unstructured":"Gould H.W.: Combinatorial Identities. Morgantown Printing and Binding, Morgantown (1972)"},{"key":"892_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0004972700017883","volume":"41","author":"K. Gray","year":"1990","unstructured":"Gray K.: On the minimal number of blocks defining a design. Bull. Austral. Math. Soc. 41, 97\u2013112 (1990)","journal-title":"Bull. Austral. Math. Soc."},{"key":"892_CR12","first-page":"97","volume":"38","author":"K. Gray","year":"1990","unstructured":"Gray K.: Defining sets of single-transposition free designs. Util. Math. 38, 97\u2013103 (1990)","journal-title":"Util. Math."},{"key":"892_CR13","first-page":"39","volume":"14","author":"C.S. Greenhill","year":"1993","unstructured":"Greenhill C.S.: An algorithm for finding smallest defining sets of t-designs. J. Combin. Math. Combin. Comput. 14, 39\u201360 (1993)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"892_CR14","first-page":"67","volume":"75","author":"G. Havas","year":"2008","unstructured":"Havas G., Lawrence J.L., Ramsay C., Street A.P., Yaz\u0131c\u0131 E.\u015e.: Defining set spectra for designs can have arbitrarily large gaps. Util. Math. 75, 67\u201381 (2008)","journal-title":"Util. Math."},{"key":"892_CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0378-3758(86)90131-X","volume":"13","author":"H.L. Hwang","year":"1986","unstructured":"Hwang H.L.: On the structure of (v, k, t) trades. J. Statist. Plann. Inference 13, 179\u2013191 (1986)","journal-title":"J. Statist. Plann. Inference"},{"key":"892_CR16","first-page":"209","volume":"17","author":"A. Khodkar","year":"1995","unstructured":"Khodkar A.: Smallest defining sets for the 36 non-isomorphic twofold triple systems of order nine. J. Combin. Math. Combin. Comput. 17, 209\u2013215 (1995)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"892_CR17","first-page":"115","volume":"32","author":"G.B. Khosrovshahi","year":"1991","unstructured":"Khosrovshahi G.B., Vatan F.: On 3-(8, 4, \u03bb) designs. Ars Combin. 32, 115\u2013120 (1991)","journal-title":"Ars Combin."},{"key":"892_CR18","unstructured":"Koloto\u01e7lu, E.: A new algorithm for finding the complete list of minimal defining sets of t-designs. Master Thesis, Ko\u00e7 University, July 2007"},{"key":"892_CR19","unstructured":"Lawrence, J.L.: The program complete. Private communication to Anne Penfold Street"},{"key":"892_CR20","unstructured":"McKay, B.D.: Nauty User\u2019s Guide (Version 1.5). Australian National University of Computer Science. Technical Report TR-CS-90-02 (1990)"},{"key":"892_CR21","first-page":"265","volume":"10","author":"T. Moran","year":"1994","unstructured":"Moran T.: Smallest defining sets for 2-(9, 4, 3) and 3-(10, 5, 3) designs. Austral. J. Combin. 10, 265\u2013288 (1994)","journal-title":"Austral. J. Combin."},{"key":"892_CR22","first-page":"205","volume":"52","author":"C. Ramsay","year":"1997","unstructured":"Ramsay C.: An algorithm for completing partials, with an application to the smallest defining sets of the STS(15). Util. Math. 52, 205\u2013221 (1997)","journal-title":"Util. Math."},{"key":"892_CR23","first-page":"3","volume":"24","author":"C. Ramsay","year":"1997","unstructured":"Ramsay C.: An algorithm for enumerating trades in designs, with an application to defining sets. J. Combin. Math. Combin. Comput. 24, 3\u201331 (1997)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"892_CR24","unstructured":"Yaz\u0131c\u0131, E.\u015e.: Minimal defining sets of t-designs. http:\/\/home.ku.edu.tr\/~eyazici\/Research\/MDS"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0892-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0892-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0892-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:30Z","timestamp":1559041110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0892-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,26]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["892"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0892-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,26]]}}}