{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:11:59Z","timestamp":1758823919724},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00493-019-3920-8","type":"journal-article","created":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T03:05:36Z","timestamp":1580785536000},"page":"39-62","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Homomorphism Thresholds for Odd Cycles"],"prefix":"10.1007","volume":"40","author":[{"given":"Oliver","family":"Ebsen","sequence":"first","affiliation":[]},{"given":"Mathias","family":"Schacht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,3]]},"reference":[{"key":"3920_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.aim.2012.11.016","volume":"235","author":"P Allen","year":"2013","unstructured":"P. Allen, J. B\u00f6ttcher, S. Griffiths, Y. Kohayakawa and R. Morris: The chromatic thresholds of graphs, Adv. Math.235 (2013), 261\u2013295.","journal-title":"Adv. Math."},{"key":"3920_CR2","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF02020809","volume":"13","author":"B Andr\u00e1sfai","year":"1962","unstructured":"B. Andr\u00e1sfai: \u00dcber ein Extremalproblem der Graphentheorie, Acta Math. Acad. Sci. Hungar.13 (1962), 443\u2013455 (in German).","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"3920_CR3","doi-asserted-by":"crossref","unstructured":"B. Andr\u00e1sfai: Graphentheoretische Extremalprobleme, Acta Math. Acad. Sci. Hungar15 (2), 413\u2013438 (in German).","DOI":"10.1007\/BF01897150"},{"key":"3920_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90133-2","volume":"8","author":"B Andr\u00e1sfai","year":"1974","unstructured":"B. Andr\u00e1sfai, P. Erd\u0151s and V. S\u00f3As: On the connection between chromatic number, maximal clique and minimal degree of a graph, Discrete Math.8 (1974), 205\u2013218.","journal-title":"Discrete Math."},{"key":"3920_CR5","first-page":"21","volume":"7F","author":"P Erd\u0151s","year":"1957","unstructured":"P. Erd\u0151s: Remarks on a theorem of Ramsay, Bull. Res. Council Israel. Sect. F7F (1957\/1058), 21\u201324.","journal-title":"Bull. Res. Council Israel. Sect. F"},{"key":"3920_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Erdos","year":"1959","unstructured":"P. Erdos and T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar10 (1959), 337\u2013356.","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"3920_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0012-365X(73)90126-X","volume":"5","author":"P Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s and M. Simonovits: On a valence problem in extremal graph theory, Discrete Math.5 (1973), 323\u2013334.","journal-title":"Discrete Math."},{"key":"3920_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/jgt.20505","volume":"66","author":"W Goddard","year":"2011","unstructured":"W. Goddard and J. Lyle: Dense graphs with small clique number, J. Graph Theory66 (2011), 319\u2013331.","journal-title":"J. Graph Theory"},{"key":"3920_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/jgt.3190080109","volume":"8","author":"A Gy\u00e1rf\u00e1s","year":"1984","unstructured":"A. Gy\u00e1rf\u00e1s, C. Rousseau and R. Schelp: An extremal problem for paths in bipartite graphs, J. Graph Theory8 (1984), 83\u201395.","journal-title":"J. Graph Theory"},{"key":"3920_CR10","first-page":"89","volume-title":"Graph theory (Cambridge, 1981), North-Holland Math. Stud.","author":"R H\u00e4ggkvist","year":"1982","unstructured":"R. H\u00e4ggkvist, Odd cycles of specified length in nonbipartite graphs, Graph theory (Cambridge, 1981), North-Holland Math. Stud., vol. 62, North-Holland, Amsterdam-New York, 1982, 89\u201399."},{"key":"3920_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S Janson","year":"2000","unstructured":"S. Janson, T. Luczak and A. Ruci\u0144ski: Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000."},{"key":"3920_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/jgt.22369","volume":"90","author":"S Letzter","year":"2019","unstructured":"S. Letzter and R. Snyder: The homomorphism threshold of {C3, C5}-free graphs, J. Graph Theory90 (2019), 83\u2013106.","journal-title":"J. Graph Theory"},{"key":"3920_CR13","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00493-006-0028-8","volume":"26","author":"T Luczak","year":"2006","unstructured":"T. Luczak: On the structure of triangle-free graphs of large minimum degree, Combinatorica26 (2006), 489\u2013493.","journal-title":"Combinatorica"},{"key":"3920_CR14","unstructured":"T. Luczak and S. Thomass\u00e9: Coloring dense graphs via VC-dimension, Coloring dense graphs via VC-dimension, available at arXiv:1007.1670."},{"key":"3920_CR15","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s00373-010-0994-x","volume":"27","author":"J Lyle","year":"2011","unstructured":"J. Lyle, On the chromatic number of H-free graphs of large minimum degree, Graphs Combin.27 (2011), 741\u2013754.","journal-title":"Graphs Combin."},{"key":"3920_CR16","unstructured":"V. Nikiforov, Chromatic number and minimum degree of Kr-free graphs, available at arXiv:1001.2070."},{"key":"3920_CR17","unstructured":"H. Oberkampf and M. Schacht: On the structure of dense graphs with fixed clique number, Combin. Probab. Comput., available at arXiv:1602.02302. To appear."},{"key":"3920_CR18","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00493-002-0009-5","volume":"22","author":"C Thomassen","year":"2002","unstructured":"C. Thomassen, On the chromatic number of triangle-free graphs of large minimum degree, Combinatorica22 (2002), 591\u2013596.","journal-title":"Combinatorica"},{"key":"3920_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00493-007-0054-1","volume":"27","author":"C Thomassen","year":"2007","unstructured":"C. Thomassen, On the chromatic number of pentagon-free graphs of large minimum degree, Combinatorica27 (2007), 241\u2013243.","journal-title":"Combinatorica"},{"key":"3920_CR20","doi-asserted-by":"publisher","first-page":"10","DOI":"10.4064\/cm-1-1-10-14","volume":"1","author":"K Zarankiewicz","year":"1947","unstructured":"K. Zarankiewicz, Sur les relations syn\u00e9triques dans l\u2019ensemble fini, Colloquium Math.1 (1947), 10\u201314 (in French).","journal-title":"Colloquium Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-3920-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-019-3920-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-3920-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T01:05:32Z","timestamp":1612227932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-019-3920-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["3920"],"URL":"https:\/\/doi.org\/10.1007\/s00493-019-3920-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2]]},"assertion":[{"value":"19 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}