{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T11:41:13Z","timestamp":1690890073059},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00493-023-00007-w","type":"journal-article","created":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T06:02:06Z","timestamp":1684821726000},"page":"57-89","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Density of Critical Graphs with No Large Cliques"],"prefix":"10.1007","volume":"43","author":[{"given":"Tom","family":"Kelly","sequence":"first","affiliation":[]},{"given":"Luke","family":"Postle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","volume":"82","author":"K Appel","year":"1976","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. Bull. Am. Math. Soc. 82(5), 711\u2013712 (1976)","journal-title":"Bull. Am. Math. Soc."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.jctb.2022.01.009","volume":"155","author":"M Bonamy","year":"2022","unstructured":"Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. J. Comb. Theory Ser. B 155, 278\u2013317 (2022)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Camb. Philos. Soc. 37(2), 194\u2013197 (1941)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"7_CR4","unstructured":"Delcourt, M.,\u00a0Postle, L.: On the list coloring version of Reed\u2019s Conjecture"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1112\/plms\/s3-7.1.161","volume":"7","author":"GA Dirac","year":"1957","unstructured":"Dirac, G.A.: A theorem of R. L. Brooks and a conjecture of H. Hadwiger. Proc. Lond. Math. Soc. (3) 7, 161\u2013195 (1957)","journal-title":"Proc. Lond. Math. Soc. (3)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jctb.2017.09.001","volume":"129","author":"Z Dvo\u0159\u00e1k","year":"2018","unstructured":"Dvo\u0159\u00e1k, Z., Postle, L.: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. J. Comb. Theory Ser. B 129, 38\u201354 (2018)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR7","first-page":"165","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai, T.: Kritische Graphen. I. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8, 165\u2013192 (1963)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"7_CR8","first-page":"373","volume":"8","author":"T Gallai","year":"1964","unstructured":"Gallai, T.: Kritische Graphen. II. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8, 373\u2013395 (1964)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Hurley, E., de Joannis de Verclos, R., Kang, R. J.: An improved procedure for colouring graphs of bounded local density. Adv. Comb. Paper No. 7, 33 pp. (2022)","DOI":"10.19086\/aic.2022.7"},{"key":"7_CR10","series-title":"A Wiley-Interscience Publication","volume-title":"Graph Coloring Problems. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication, Wiley, New York (1995)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jctb.2019.08.001","volume":"141","author":"T Kelly","year":"2020","unstructured":"Kelly, T., Postle, L.: A local epsilon version of Reed\u2019s Conjecture. J. Comb. Theory Ser. B 141, 181\u2013222 (2020)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Kelly, T., Postle, L.: A local epsilon version of Reed\u2019s Conjecture. arXiv:1911.02672 (2021)","DOI":"10.1016\/j.jctb.2019.08.001"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.jctb.2021.06.004","volume":"151","author":"T Kelly","year":"2021","unstructured":"Kelly, T., Postle, L.: Corrigendum to \u201cA local epsilon version of Reed\u2019s Conjecture\u2019\u2019 [J. Comb. Theory Ser. B 141 (2020) 181\u2013222]. J. Comb. Theory Ser. B 151, 509\u2013512 (2021)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR14","unstructured":"Kostochka, A.V.,\u00a0Stiebitz, M.: Excess in colour-critical graphs. In Graph theory and combinatorial biology (Balatonlelle, 1996), volume\u00a07 of Bolyai Soc. Math. Stud., pp. 87\u201399. J\u00e1nos Bolyai Math. Soc., Budapest (1999)"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s004930070005","volume":"20","author":"A Kostochka","year":"2000","unstructured":"Kostochka, A., Stiebitz, M.: On the number of edges in colour-critical graphs and hypergraphs. Combinatorica 20(4), 521\u2013530 (2000)","journal-title":"Combinatorica"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jctb.2014.05.002","volume":"109","author":"A Kostochka","year":"2014","unstructured":"Kostochka, A., Yancey, M.: Ore\u2019s conjecture on color-critical graphs is almost true. J. Comb. Theory Ser. B 109, 73\u2013101 (2014)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF01215921","volume":"17","author":"M Krivelevich","year":"1997","unstructured":"Krivelevich, M.: On the minimal number of edges in color-critical graphs. Combinatorica 17(3), 401\u2013426 (1997)","journal-title":"Combinatorica"},{"key":"7_CR18","volume-title":"The Four-Color Problem. Pure and Applied Mathematics","author":"O Ore","year":"1967","unstructured":"Ore, O.: The Four-Color Problem. Pure and Applied Mathematics. Academic Press, New York (1967)"},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-K","volume":"27","author":"B Reed","year":"1998","unstructured":"Reed, B.: $$\\omega $$, $${\\Delta }$$, and $$\\chi $$. J. Graph Theory 27(4), 177\u2013212 (1998)","journal-title":"J. Graph Theory"},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/S0196-8858(02)00037-4","volume":"29","author":"I Rivin","year":"2002","unstructured":"Rivin, I.: Counting cycles and finite dimensional $$L^p$$ norms. Adv. Appl. Math. 29(4), 647\u2013662 (2002)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. J. Comb. Theory Ser. B 70(1), 2\u201344 (1997)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00007-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00007-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00007-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T11:03:19Z","timestamp":1690887799000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00007-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00007-w","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]},"assertion":[{"value":"6 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}