{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:43Z","timestamp":1740107143754,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T00:00:00Z","timestamp":1525824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00373-018-1895-7","type":"journal-article","created":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T12:55:42Z","timestamp":1525870542000},"page":"571-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds on the Sizes of Defining Sets in Full n-Latin Squares and Full Designs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9151-3842","authenticated-orcid":false,"given":"Nicholas J.","family":"Cavenagh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,9]]},"reference":[{"key":"1895_CR1","first-page":"55","volume":"8","author":"S Akbari","year":"1993","unstructured":"Akbari, S., Maimani, H.R., Maysoori, C.H.: Minimal defining sets for full \n                    \n                      \n                    \n                    $$2$$\n                    \n                      \n                        \n                          2\n                        \n                      \n                    \n                  -\n                    \n                      \n                    \n                    $$(v,3, v-2)$$\n                    \n                      \n                        \n                          (\n                          v\n                          ,\n                          3\n                          ,\n                          v\n                          -\n                          2\n                          )\n                        \n                      \n                    \n                   designs. Australas. J. Comb. 8, 55\u201373 (1993)","journal-title":"Australas. J. Comb."},{"key":"1895_CR2","doi-asserted-by":"publisher","first-page":"691","DOI":"10.2478\/s12175-008-0103-2","volume":"58","author":"NJ Cavenagh","year":"2008","unstructured":"Cavenagh, N.J.: The theory and application of Latin bitrades: a survey. Math. Slovaca 58, 691\u2013718 (2008)","journal-title":"Math. Slovaca"},{"key":"1895_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00026-016-0322-0","volume":"20","author":"NJ Cavenagh","year":"2016","unstructured":"Cavenagh, N.J., Raass, V.: Critical sets of \n                    \n                      \n                    \n                    $$2$$\n                    \n                      \n                        \n                          2\n                        \n                      \n                    \n                  -balanced Latin rectangles. Ann. Comb. 20, 525\u2013538 (2016)","journal-title":"Ann. Comb."},{"key":"1895_CR4","first-page":"1","volume":"20","author":"NJ Cavenagh","year":"2016","unstructured":"Cavenagh, N.J., Raass, V.: Critical sets of full \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -Latin squares. Graphs Comb. 20, 1\u201314 (2016)","journal-title":"Graphs Comb."},{"key":"1895_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00373-012-1256-x","volume":"30","author":"F Demirkale","year":"2014","unstructured":"Demirkale, F., Yazici, E.S.: On the spectrum of minimal defining sets of full designs. Graphs Comb. 30, 141\u2013157 (2014)","journal-title":"Graphs Comb."},{"key":"1895_CR6","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00026-012-0143-8","volume":"16","author":"D Donovan","year":"2012","unstructured":"Donovan, D., Lefevre, J., Waterhouse, M., Yazici, E.S.: Defining sets of full designs with block size three II. Ann. Comb. 16, 507\u2013515 (2012)","journal-title":"Ann. Comb."},{"key":"1895_CR7","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s00373-010-0882-4","volume":"25","author":"D Donovan","year":"2009","unstructured":"Donovan, D., Lefevre, J., Waterhouse, M., Yazici, E.S.: On defining sets of full designs with block size three. Graphs Comb. 25, 825\u2013839 (2009)","journal-title":"Graphs Comb."},{"key":"1895_CR8","first-page":"91","volume":"76","author":"K Gray","year":"2008","unstructured":"Gray, K., Street, A.P.: Constructing defining sets of full designs. Util. Math. 76, 91\u201399 (2008)","journal-title":"Util. Math."},{"key":"1895_CR9","first-page":"97","volume":"60","author":"K Gray","year":"2007","unstructured":"Gray, K., Street, A.P.: On defining sets of full designs and of designs related to them. J. Comb. Math. Comb. Comput. 60, 97\u2013104 (2007)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1895_CR10","first-page":"382","volume-title":"CRC Handbook of Combinatorial Designs","author":"K Gray","year":"2007","unstructured":"Gray, K., Street, A.P.: Defining sets, Section IV.13. In: Colbourn, C.J., Dinitz, J.H. (eds.) CRC Handbook of Combinatorial Designs, 2nd edn, pp. 382\u2013385. CRC Press, Boca Raton (2007)","edition":"2"},{"key":"1895_CR11","first-page":"383","volume":"97A","author":"K Gray","year":"2010","unstructured":"Gray, K., Street, A.P., Stanton, R.G.: Using affine planes to partition full designs with block size three. Ars Comb. 97A, 383\u2013402 (2010)","journal-title":"Ars Comb."},{"key":"1895_CR12","first-page":"97","volume":"65","author":"AD Keedwell","year":"2004","unstructured":"Keedwell, A.D.: Critical sets in Latin squares and related matters: an update. Util. Math. 65, 97\u2013131 (2004)","journal-title":"Util. Math."},{"key":"1895_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s00373-010-0892-2","volume":"26","author":"E Kolotoglu","year":"2010","unstructured":"Kolotoglu, E., Yazici, E.S.: On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \n                    \n                      \n                    \n                    $$t$$\n                    \n                      \n                        t\n                      \n                    \n                  -designs. Graphs Comb. 26, 259\u2013281 (2010)","journal-title":"Graphs Comb."},{"key":"1895_CR14","doi-asserted-by":"publisher","first-page":"3000","DOI":"10.1016\/j.disc.2010.07.010","volume":"310","author":"J Lefevre","year":"2010","unstructured":"Lefevre, J., Waterhouse, M.: On defining sets of full designs. Discrete Math. 310, 3000\u20133006 (2010)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1895-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1895-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1895-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T19:16:18Z","timestamp":1557342978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1895-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1895"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1895-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,5,9]]},"assertion":[{"value":"4 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}