{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:53Z","timestamp":1740107153403,"version":"3.37.3"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T00:00:00Z","timestamp":1573862400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T00:00:00Z","timestamp":1573862400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000608","name":"London Mathematical Society","doi-asserted-by":"publisher","award":["URB 14-30"],"award-info":[{"award-number":["URB 14-30"]}],"id":[{"id":"10.13039\/501100000608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00373-019-02115-1","type":"journal-article","created":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T15:01:26Z","timestamp":1573916486000},"page":"27-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Classification of Maximum Hittings by Large Families"],"prefix":"10.1007","volume":"36","author":[{"given":"Candida","family":"Bowtell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Mycroft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,16]]},"reference":[{"key":"2115_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/eujc.1995.0092","volume":"18","author":"R Ahlswede","year":"1997","unstructured":"Ahlswede, R., Khachatrian, L.: The complete intersection theorem for systems of finite sets. Eur. J. Combin. 18, 125\u2013136 (1997)","journal-title":"Eur. J. Combin."},{"key":"2115_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00373-012-1281-9","volume":"30","author":"B Barber","year":"2014","unstructured":"Barber, B.: Maximum hitting for $$n$$ sufficiently large. Graphs Combin. 30, 267\u2013274 (2014)","journal-title":"Graphs Combin."},{"key":"2115_CR3","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/s00373-010-1001-2","volume":"27","author":"P Borg","year":"2011","unstructured":"Borg, P.: Maximum hitting of a set by compressed intersecting families. Graphs Combin. 27, 785\u2013797 (2011)","journal-title":"Graphs Combin."},{"key":"2115_CR4","doi-asserted-by":"publisher","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. Q. J. Math. Oxf. 12, 313\u2013320 (1961)","journal-title":"Q. J. Math. Oxf."},{"key":"2115_CR5","first-page":"81","volume-title":"The Shifting Technique in Extremal Set Theory, Surveys in Combinatorics","author":"P Frankl","year":"1987","unstructured":"Frankl, P.: The Shifting Technique in Extremal Set Theory, Surveys in Combinatorics, pp. 81\u2013110. Cambridge University Press, Cambridge (1987)"},{"key":"2115_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1090\/proc\/13221","volume":"145","author":"J Han","year":"2017","unstructured":"Han, J., Kohayakawa, Y.: The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton\u2013Milner family. Proc. Am. Math. Soc. 145, 73\u201387 (2017)","journal-title":"Proc. Am. Math. Soc."},{"key":"2115_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1093\/qmath\/18.1.369","volume":"18","author":"A Hilton","year":"1967","unstructured":"Hilton, A., Milner, E.: Some intersection theorems for systems of finite sets. Q. J. Math. Oxf. 18, 369\u2013384 (1967)","journal-title":"Q. J. Math. Oxf."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02115-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02115-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02115-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,15]],"date-time":"2020-11-15T00:35:00Z","timestamp":1605400500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02115-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,16]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["2115"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02115-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,11,16]]},"assertion":[{"value":"3 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}