{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:31Z","timestamp":1740122491135,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:00:00Z","timestamp":1725321600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:00:00Z","timestamp":1725321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","award":["KKP 133819"],"award-info":[{"award-number":["KKP 133819"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["132696"],"award-info":[{"award-number":["132696"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2153507"],"award-info":[{"award-number":["DMS-2153507"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10623-024-01484-w","type":"journal-article","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T07:02:18Z","timestamp":1725346938000},"page":"4189-4194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimal abundant packings and choosability with separation"],"prefix":"10.1007","volume":"92","author":[{"given":"Zolt\u00e1n","family":"F\u00fcredi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandr","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohit","family":"Kumbhat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,3]]},"reference":[{"key":"1484_CR1","unstructured":"Hall M. Jr.: Combinatorial theory. Wiley-Interscience Series in Discrete Mathematics, 2nd edn., p. 440. Wiley, New York (1986)."},{"key":"1484_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/tit.1962.1057714","volume":"8","author":"SM Johnson","year":"1962","unstructured":"Johnson S.M.: A new upper bound for error-correcting codes. IRE Trans. IT 8, 203\u2013207 (1962). https:\/\/doi.org\/10.1109\/tit.1962.1057714.","journal-title":"IRE Trans. IT"},{"issue":"4","key":"1484_CR3","first-page":"41","volume":"1","author":"LA Bassalygo","year":"1965","unstructured":"Bassalygo L.A.: New upper bounds for error-correcting codes. Problemy. Pereda\u010di. Informacii. 1(4), 41\u201344 (1965).","journal-title":"Problemy. Pereda\u010di. Informacii."},{"key":"1484_CR4","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1090\/chel\/361","volume-title":"Combinatorial Problems and Exercises","author":"L Lov\u00e1sz","year":"2007","unstructured":"Lov\u00e1sz L.: Combinatorial Problems and Exercises, 2nd edn, p. 642. AMS Chelsea Publishing, Providence (2007) https:\/\/doi.org\/10.1090\/chel\/361.","edition":"2"},{"issue":"2","key":"1484_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1112\/S0025579300006069","volume":"22","author":"MN Huxley","year":"1975","unstructured":"Huxley M.N., Iwaniec H.: Bombieri\u2019s theorem in short intervals. Mathematika 22(2), 188\u2013194 (1975). https:\/\/doi.org\/10.1112\/S0025579300006069.","journal-title":"Mathematika"},{"key":"1484_CR6","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl J., Tuza Z., Voigt M.: Brooks-type theorems for choosability with separation. J. Graph. Theory 27(1), 43\u201349 (1998).","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<43::AID-JGT7>3.3.CO;2-Q"},{"issue":"1","key":"1484_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/jcta.1996.0067","volume":"75","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi Z.: New asymptotics for bipartite Tur\u00e1n numbers. J. Combin. Theory Ser. A 75(1), 141\u2013144 (1996). https:\/\/doi.org\/10.1006\/jcta.1996.0067.","journal-title":"J. Combin. Theory Ser. A"},{"key":"1484_CR8","first-page":"3","volume":"29","author":"VG Vizing","year":"1976","unstructured":"Vizing V.G.: Coloring the vertices of a graph in prescribed colors. Discret. Analiz 29, 3\u201310101 (1976).","journal-title":"Discret. Analiz"},{"issue":"4","key":"1484_CR9","doi-asserted-by":"publisher","first-page":"113298","DOI":"10.1016\/j.disc.2022.113298","volume":"346","author":"F Yang","year":"2023","unstructured":"Yang F., Wang Y., Wu J.-L.: 4-choosability of planar graphs with 4-cycles far apart via the combinatorial Nullstellensatz. Discret. Math. 346(4), 113298\u2013113316 (2023). https:\/\/doi.org\/10.1016\/j.disc.2022.113298.","journal-title":"Discret. Math."},{"issue":"1","key":"1484_CR10","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/jgt.22646","volume":"97","author":"Z Dvo\u0159\u00e1k","year":"2021","unstructured":"Dvo\u0159\u00e1k Z., Esperet L., Kang R.J., Ozeki K.: Single-conflict colouring. J. Graph. Theory 97(1), 148\u2013160 (2021). https:\/\/doi.org\/10.1002\/jgt.22646.","journal-title":"J. Graph. Theory"},{"issue":"5","key":"1484_CR11","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1017\/s0963548319000026","volume":"28","author":"L Esperet","year":"2019","unstructured":"Esperet L., Kang R.J., Thomass\u00e9 S.: Separation choosability and dense bipartite induced subgraphs. Combin. Probab. Comput. 28(5), 720\u2013732 (2019). https:\/\/doi.org\/10.1017\/s0963548319000026.","journal-title":"Combin. Probab. Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01484-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01484-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01484-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:24:34Z","timestamp":1732310674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01484-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,3]]},"references-count":11,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1484"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01484-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,9,3]]},"assertion":[{"value":"9 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}