{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T06:49:58Z","timestamp":1654066198142},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T00:00:00Z","timestamp":1294185600000},"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":[[2011,11]]},"DOI":"10.1007\/s00373-010-1001-2","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T08:13:31Z","timestamp":1294128811000},"page":"785-797","source":"Crossref","is-referenced-by-count":6,"title":["Maximum Hitting of a Set by Compressed Intersecting Families"],"prefix":"10.1007","volume":"27","author":[{"given":"Peter","family":"Borg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,5]]},"reference":[{"key":"1001_CR1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0097-3165(74)90013-2","volume":"17","author":"D.E. Daykin","year":"1974","unstructured":"Daykin D.E.: Erd\u0151s-Ko-Rado from Kruskal-Katona. J. Combin. Theory Ser. A 17, 254\u2013255 (1974)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1001_CR2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0604042","volume":"4","author":"M. Deza","year":"1983","unstructured":"Deza M., Frankl P.: The Erd\u0151s\u2013Ko\u2013Rado theorem\u201422\u00a0years later. SIAM J. Algebraic Discret. Methods 4, 419\u2013431 (1983)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"1001_CR3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s P., Ko C., Rado R.: Intersection theorems for systems of finite sets. Quart. J. Math. Oxford (2) 12, 313\u2013320 (1961)","journal-title":"Quart. J. Math. Oxford (2)"},{"key":"1001_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P., Rado R.: Intersection theorems for systems of sets. J. London Math. Soc. 35, 85\u201390 (1960)","journal-title":"J. London Math. Soc."},{"key":"1001_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s004930070029","volume":"20","author":"P.L. Erd\u0151s","year":"2000","unstructured":"Erd\u0151s P.L., Seress \u00c1., Sz\u00e9kely L.A.: Erd\u0151s-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets. Combinatorica 20, 27\u201345 (2000)","journal-title":"Combinatorica"},{"key":"1001_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0097-3165(78)90003-1","volume":"24","author":"P. Frankl","year":"1978","unstructured":"Frankl P.: On intersecting families of finite sets. J. Combin. Theory Ser. A 24, 146\u2013161 (1978)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1001_CR7","first-page":"81","volume-title":"Combinatorial Surveys","author":"P. Frankl","year":"1987","unstructured":"Frankl P.: The shifting technique in extremal set theory. In: Whitehead, C. (ed). Combinatorial Surveys, pp. 81\u2013110. Cambridge University Press, London (1987)"},{"key":"1001_CR8","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0097-3165(86)90121-4","volume":"41","author":"P. Frankl","year":"1986","unstructured":"Frankl P., Furedi Z.: Non-trivial intersecting families. J. Combin. Theory Ser. A 41, 150\u2013153 (1986)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1001_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0097-3165(92)90054-X","volume":"61","author":"P. Frankl","year":"1992","unstructured":"Frankl P., Tokushige N.: Some best possible inequalities concerning cross-intersecting families. J. Combin. Theory Ser. A 61, 87\u201397 (1992)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1001_CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0097-3165(73)90085-X","volume":"15","author":"A. Hajnal","year":"1973","unstructured":"Hajnal A., Rothschild B.: A generalization of the Erd\u0151s\u2013Ko\u2013Rado theorem on finite set systems. J. Combin. Theory Ser. A 15, 359\u2013362 (1973)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1001_CR11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1093\/qmath\/18.1.369","volume":"18","author":"A.J.W. Hilton","year":"1967","unstructured":"Hilton A.J.W., Milner E.C.: Some intersection theorems for systems of finite sets. Quart. J. Math. Oxford (2) 18, 369\u2013384 (1967)","journal-title":"Quart. J. Math. Oxford (2)"},{"key":"1001_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.disc.2004.08.028","volume":"293","author":"F.C. Holroyd","year":"2005","unstructured":"Holroyd F.C., Talbot J.: Graphs with the Erd\u0151s-Ko-Rado property. Discret. Math. 293, 165\u2013176 (2005)","journal-title":"Discret. Math."},{"key":"1001_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(72)90054-8","volume":"13","author":"G.O.H. Katona","year":"1972","unstructured":"Katona G.O.H.: A simple proof of the Erd\u0151s\u2013Chao Ko\u2013Rado theorem. J. Combin. Theory Ser. B 13, 183\u2013184 (1972)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1001_CR14","unstructured":"Katona, G.O.H.: A theorem of finite sets. In: Theory of Graphs, Proc. Colloq. Tihany, Akad\u00e9miai Kiad\u00f3, pp. 187\u2013207. Academic Press, New York (1968)"},{"key":"1001_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1525\/9780520319875-014","volume-title":"Mathematical optimization techniques","author":"J.B. Kruskal","year":"1963","unstructured":"Kruskal J.B.: The number of simplices in a complex. In: Bellman, R. (ed). Mathematical optimization techniques, pp. 251\u2013278. University of California Press, Berkeley, California (1963)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-1001-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-1001-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-1001-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T21:00:24Z","timestamp":1637096424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-1001-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,5]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["1001"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-1001-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,5]]}}}