{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:05:49Z","timestamp":1754161549557,"version":"3.41.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1008329410829","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"279-299","source":"Crossref","is-referenced-by-count":27,"title":["Lower Bounds for Transversal Covers"],"prefix":"10.1007","volume":"15","author":[{"given":"Brett","family":"Stevens","sequence":"first","affiliation":[]},{"given":"Lucia","family":"Moura","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Mendelsohn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"185608_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/52.536462","volume":"13","author":"D. M. Cohen","year":"1996","unstructured":"D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton, The combinatorial design approach to automatic test generation, IEEE Software, Vol. 13, No.5 (1996) pp. 83-88.","journal-title":"IEEE Software"},{"key":"185608_CR2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P. Erd\u00f6s","year":"1961","unstructured":"P. Erd\u00f6s, C. Ko, and R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford, Vol. 12 (1961) pp. 313-318.","journal-title":"Quart. J. Math. Oxford"},{"key":"185608_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z. F\u00fcredi","year":"1988","unstructured":"Z. F\u00fcredi, Matchings and cover in hypergraphs, Graphs Combin., Vol. 4 (1988) pp. 115-206.","journal-title":"Graphs Combin."},{"key":"185608_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0097-3165(92)90016-N","volume":"61","author":"L. Gargano","year":"1992","unstructured":"L. Gargano, J. K\u00f6rner, and U. Vaccaro, Qualitative independence and Sperner problems for directed graphs, J. Combin. Theory. Ser. A, Vol. 61 (1992) pp. 173-192.","journal-title":"J. Combin. Theory. Ser. A"},{"key":"185608_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01195325","volume":"9","author":"L. Gargano","year":"1993","unstructured":"L. Gargano, J. K\u00f6rner, and U. Vaccaro, Sperner capacities, Graphs Combin., Vol. 9 (1993) pp. 31-46.","journal-title":"Graphs Combin."},{"key":"185608_CR6","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0097-3165(94)90108-2","volume":"68","author":"L. Gargano","year":"1994","unstructured":"L. Gargano, J. K\u00f6rner, and U. Vaccaro, Capacities: From information theory to extremal set theory, J. Combin. Theory. Ser. A, Vol. 68 (1994) pp. 296-316.","journal-title":"J. Combin. Theory. Ser. A"},{"key":"185608_CR7","first-page":"221","volume":"273","author":"F. Jaeger","year":"1971","unstructured":"F. Jaeger and C. Payan, Nombre maximal d'ar\u00e9tes d'un hypergraphe critique de rang h, C. R. Acad. Sci. Paris, Vol. 273 (1971) pp. 221-223.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"185608_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02018457","volume":"3","author":"G. O. H. Katona","year":"1973","unstructured":"G. O. H. Katona, Two applications (for search theory and truth functions) of Sperner type theorems, Period. Math. Hungar., Vol. 3 (1973) pp. 19-26.","journal-title":"Period. Math. Hungar."},{"key":"185608_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0097-3165(74)90018-1","volume":"17","author":"G. O. H. Katona","year":"1974","unstructured":"G. O. H. Katona, Solution of a problem of Ehrenfeucht and Mycielski, J. Combin. Theory. Ser. A, Vol. 17 (1974) pp. 265-266.","journal-title":"J. Combin. Theory. Ser. A"},{"key":"185608_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"D. J. Kleitman","year":"1973","unstructured":"D. J. Kleitman and J. Spencer, Families of k-independent sets, Discrete Math., Vol. 6 (1973) pp. 255-262.","journal-title":"Discrete Math"},{"issue":"3","key":"185608_CR11","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1109\/18.335882","volume":"40","author":"J. K\u00f6rner","year":"1994","unstructured":"J. K\u00f6rner and M. Lucertini, Compressing inconsistent data, IEEE Trans. Inform. Theory, Vol. 40, No.3 (1994) pp. 706-715.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"185608_CR12","unstructured":"B. Stevens, A. Ling and E. Mendelsohn, A direct construction of transversal covers using group divisible designs, in preparation."},{"key":"185608_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0097-3165(89)90081-2","volume":"51","author":"S. Poljak","year":"1989","unstructured":"S. Poljak and Z. Tuza, On the maximum number of qualitatively independent partitions, J. Combin. Theory. Ser. A, Vol. 51 (1989) pp. 111-116.","journal-title":"J. Combin. Theory. Ser. A"},{"key":"185608_CR14","volume-title":"Foundations of Probability","author":"A. R\u00e9nyi","year":"1971","unstructured":"A. R\u00e9nyi, Foundations of Probability, Wiley, New York (1971)."},{"key":"185608_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"N. J. A. Sloane","year":"1993","unstructured":"N. J. A. Sloane, Covering arrays and intersecting codes, J. Combin. Des., Vol. 1 (1993) pp. 51-63.","journal-title":"J. Combin. Des."},{"key":"185608_CR16","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E. Sperner","year":"1928","unstructured":"E. Sperner, Ein satz \u00dcber untermengen einer endlichen menge, Math Z., Vol. 27 (1928) pp. 544-548.","journal-title":"Math Z"},{"key":"185608_CR17","unstructured":"B. Stevens and E. Mendelsohn, New recursive methods for transversal covers, to appear in J. Combin. Des."},{"key":"185608_CR18","doi-asserted-by":"crossref","unstructured":"A. W. Williams and R. L. Probert, A practical strategy for testing pair-wise convergence of network interfaces, Proc. of the 7th International Symposium on Software Reliability Engineering, (1996) pp. 246-254.","DOI":"10.1109\/ISSRE.1996.558835"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008329410829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008329410829\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008329410829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:31:47Z","timestamp":1753756307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008329410829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["185608"],"URL":"https:\/\/doi.org\/10.1023\/a:1008329410829","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}