{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T12:36:24Z","timestamp":1769517384350,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,10,17]],"date-time":"2016-10-17T00:00:00Z","timestamp":1476662400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00493-016-3326-9","type":"journal-article","created":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T10:16:15Z","timestamp":1476785775000},"page":"673-696","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Generalising Fisher\u2019s inequality to coverings and packings"],"prefix":"10.1007","volume":"37","author":[{"given":"Daniel","family":"Horsley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,17]]},"reference":[{"key":"3326_CR1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.4153\/CMB-2000-046-9","volume":"43","author":"I. Bluskov","year":"2000","unstructured":"I. Bluskov, M. Greig and M. K. Heinrich: Infinite classes of covering numbers, Canad. Math. Bull. 43 (2000), 385\u2013396.","journal-title":"Canad. Math. Bull."},{"key":"3326_CR2","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1214\/aoms\/1177729958","volume":"20","author":"R. C. Bose","year":"1949","unstructured":"R. C. Bose: A Note on Fisher\u2019s Inequality for Balanced Incomplete Block Designs, Ann. Math. Statistics 20 (1949), 619\u2013620.","journal-title":"Ann. Math. Statistics"},{"key":"3326_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1214\/aoms\/1177729382","volume":"23","author":"R. C. Bose","year":"1952","unstructured":"R. C. Bose and W. S. Connor: Combinatorial properties of group divisible incomplete block designs, Ann. Math. Stat. 23 (1952), 367\u2013383.","journal-title":"Ann. Math. Stat."},{"key":"3326_CR4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s00493-011-2639-y","volume":"31","author":"D. Bryant","year":"2011","unstructured":"D. Bryant, M. Buchanan, D. Horsley, B. Maenhaut and V. Scharaschkin: On the non-existence of pair covering designs with at least as many points as blocks, Combinatorica 31 (2011), 507\u2013528.","journal-title":"Combinatorica"},{"key":"3326_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190150110","volume":"15","author":"Y. Caro","year":"1991","unstructured":"Y. Caro and Zs. Tuza: Improved lower bounds on k-independence, J. Graph Theory 15 (1991), 99\u2013107.","journal-title":"J. Graph Theory"},{"issue":"1","key":"3326_CR6","doi-asserted-by":"crossref","first-page":"R1","DOI":"10.37236\/1286","volume":"4","author":"Y. Caro","year":"1997","unstructured":"Y. Caro and R. Yuster: Packing graphs: the packing problem solved, Electron. J. Combin. 4 (1997), no 1, R1.","journal-title":"Electron. J. Combin."},{"key":"3326_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/jcta.1998.2867","volume":"83","author":"Y. Caro","year":"1998","unstructured":"Y. Caro and R. Yuster: Covering graphs: the covering problem solved, J. Combin. Theory Ser. A 83 (1998), 273\u2013282.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3326_CR8","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1016\/j.jcta.2013.04.005","volume":"120","author":"Y. M. Chee","year":"2013","unstructured":"Y. M. Chee, C. J. Colbourn, A. C. H. Ling and R. M. Wilson: Covering and packing for pairs, J. Combin. Theory Ser. A 120 (2013), 1440\u20131449.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3326_CR9","doi-asserted-by":"crossref","first-page":"10","DOI":"10.5486\/PMD.1963.10.1-4.02","volume":"10","author":"P. Erd\u0151s","year":"1963","unstructured":"P. Erd\u0151s and H. Hanani: On a limit theorem in combinatorial analysis, Publ. Math. Debrecen 10 (1963), 10\u201313.","journal-title":"Publ. Math. Debrecen"},{"key":"3326_CR10","doi-asserted-by":"crossref","first-page":"398","DOI":"10.5486\/PMD.1956.4.3-4.38","volume":"4","author":"P. Erd\u0151s","year":"1956","unstructured":"P. Erd\u0151s and A. R\u00e8nyi: On some combinatorical problems, Publ. Math. Debrecen 4 (1956), 398\u2013405.","journal-title":"Publ. Math. Debrecen"},{"key":"3326_CR11","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1111\/j.1469-1809.1940.tb02237.x","volume":"10","author":"R. A. Fisher","year":"1940","unstructured":"R. A. Fisher: An examination of the different possible solutions of a problem in incomplete blocks, Ann. Eugenics 10 (1940), 52\u201375.","journal-title":"Ann. Eugenics"},{"key":"3326_CR12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0097-3165(90)90034-T","volume":"54","author":"Z. F\u00fcredi","year":"1990","unstructured":"Z. F\u00fcredi: Covering pairs by q 2+q+1 sets, J. Combin. Theory Ser. A 54 (1990), 248\u2013271.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3326_CR13","unstructured":"D. M. Gordon: La Jolla Covering Repository, http:\/\/www.ccrwest.org\/cover.html."},{"key":"3326_CR14","first-page":"365","volume-title":"The CRC Handbook of Combinatorial Designs, 2nd edition","author":"D. M. Gordon","year":"2007","unstructured":"D. M. Gordon and D. R. Stinson: Coverings, in The CRC Handbook of Combinatorial Designs, 2nd edition (Eds. C. J. Colbourn, J. H. Dinitz), CRC Press (2007), 365\u2013373."},{"key":"3326_CR15","first-page":"221","volume":"70","author":"M. Greig","year":"2006","unstructured":"M. Greig, P. C. Li and G. H. J. van Rees: Covering designs on 13 blocks revisited, Util. Math. 70 (2006), 221\u2013261.","journal-title":"Util. Math."},{"key":"3326_CR16","first-page":"203","volume":"IT-8","author":"S. M. Johnson","year":"1962","unstructured":"S. M. Johnson: A new upper bound for error-correcting codes, IRE Trans. IT-8 (1962), 203\u2013207.","journal-title":"IRE Trans"},{"key":"3326_CR17","unstructured":"P. Keevash: The existence of designs, arXiv:1401.3665."},{"key":"3326_CR18","first-page":"199","volume":"8","author":"W. H. Mills","year":"1979","unstructured":"W. H. Mills: Covering designs. I. Coverings by a small number of subsets, Ars Combin. 8 (1979), 199\u2013315.","journal-title":"Ars Combin."},{"key":"3326_CR19","first-page":"371","volume-title":"Contemporary Design Theory","author":"W. H. Mills","year":"1992","unstructured":"W. H. Mills and R. C. Mullin: Coverings and packings, in: Contemporary Design Theory, (Eds. J. H. Dinitz and D. R. Stinson), Wiley, (1992), 371\u2013399."},{"key":"3326_CR20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"6","author":"V. R\u00f6dl","year":"1985","unstructured":"V. R\u00f6dl: On a packing and covering problem, European J. Combin. 6 (1985), 69\u201378.","journal-title":"European J. Combin."},{"key":"3326_CR21","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.2140\/pjm.1964.14.1405","volume":"14","author":"J. Sch\u00f6nheim","year":"1964","unstructured":"J. Sch\u00f6nheim: On coverings, Pacific J. Math. 14 (1964), 1405\u20131411.","journal-title":"Pacific J. Math."},{"key":"3326_CR22","first-page":"550","volume-title":"The CRC Handbook of Combinatorial Designs, 2nd edition","author":"D. R. Stinson","year":"2007","unstructured":"D. R. Stinson, R. Wei and J. Yin: Packings, in: The CRC Handbook of Combinatorial Designs, 2nd edition (Eds. C. J. Colbourn, J. H. Dinitz), CRC Press (2007), 550\u2013556."},{"key":"3326_CR23","doi-asserted-by":"crossref","first-page":"672","DOI":"10.2307\/2305561","volume":"56","author":"O. Taussky","year":"1949","unstructured":"O. Taussky: A recurring theorem on determinants, Amer. Math. Monthly 56 (1949), 672\u2013676.","journal-title":"Amer. Math. Monthly"},{"key":"3326_CR24","first-page":"697","volume":"37","author":"D. T. Todorov","year":"1984","unstructured":"D. T. Todorov: Some coverings derived from finite planes, Colloq. Math. Soc. J\u00e1nos Bolyai 37 (1984), 697\u2013710.","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"3326_CR25","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02124682","volume":"9","author":"D. T. Todorov","year":"1989","unstructured":"D. T. Todorov: Lower bounds for coverings of pairs by large blocks, Combinatorica 9 (1989), 217\u2013225.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3326-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3326-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3326-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T13:55:53Z","timestamp":1692539753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3326-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,17]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["3326"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3326-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,17]]}}}