{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T15:42:16Z","timestamp":1772638936892,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"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":[[2026,4]]},"DOI":"10.1007\/s00493-026-00207-0","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T10:01:02Z","timestamp":1772618462000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Orientations of Cycles in Digraphs of High Chromatic Number and High Minimum Out-Degree"],"prefix":"10.1007","volume":"46","author":[{"given":"Hidde","family":"Koerts","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Moore","sequence":"additional","affiliation":[]},{"given":"Sophie","family":"Spirkl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,4]]},"reference":[{"key":"207_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.aim.2012.11.016","volume":"235","author":"P Allen","year":"2013","unstructured":"Allen, P., B\u00f6ttcher, J., Griffiths, S., Kohayakawa, Y., Morris, R.: The chromatic thresholds of graphs. Adv. Math. 235, 261\u2013295 (2013)","journal-title":"Adv. Math."},{"issue":"5\u20136","key":"207_CR2","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S0963548303005741","volume":"12","author":"N Alon","year":"2003","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Tur\u00e1n numbers of bipartite graphs and related Ramsey-type questions. Comb. Probab. Comput. 12(5\u20136), 477\u2013494 (2003)","journal-title":"Comb. Probab. Comput."},{"key":"207_CR3","doi-asserted-by":"crossref","unstructured":"Bessy, S., Gon\u00e7alves, D., Reinald, A.: Oriented trees in $${O}(k \\sqrt{k})$$-chromatic digraphs, a subquadratic bound for Burr\u2019s conjecture. arXiv preprint arXiv:2402.19351, (2024)","DOI":"10.1007\/978-3-031-75409-8_6"},{"key":"207_CR4","unstructured":"Brandt, S., Thomass\u00e9, S.: Dense triangle-free graphs are four-colorable: A solution to the Erd\u0151s-Simonovits problem. preprint, (2011)"},{"key":"207_CR5","unstructured":"Burr, S.A.: Subtrees of directed graphs and hypergraphs. In: Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Congr. Numer, vol. 28, pp. 227\u2013239, (1980)"},{"key":"207_CR6","unstructured":"Erd\u0151s, P., Hajnal, A.: On chromatic number of infinite graphs. In: Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 83\u201398, (1968)"},{"issue":"4","key":"207_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":"Erd\u0151s, P., Simonovits, M.: On a valence problem in extremal graph theory. Discret. Math. 5(4), 323\u2013334 (1973)","journal-title":"Discret. Math."},{"issue":"4","key":"207_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/jgt.20505","volume":"66","author":"W Goddard","year":"2011","unstructured":"Goddard, W., Lyle, J.: Dense graphs with small clique number. J. Graph Theory 66(4), 319\u2013331 (2011)","journal-title":"J. Graph Theory"},{"key":"207_CR9","unstructured":"\u0141uczak, T., Thomass\u00e9, S.: Coloring dense graphs via VC-dimension. arXiv preprint arXiv:1007.1670, (2010)"},{"issue":"3","key":"207_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V Neumann-Lara","year":"1982","unstructured":"Neumann-Lara, V.: The dichromatic number of a digraph. J. Comb Theory, Ser B 33(3), 265\u2013270 (1982)","journal-title":"J. Comb Theory, Ser B"},{"issue":"4","key":"207_CR11","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00493-002-0009-5","volume":"22","author":"C Thomassen","year":"2002","unstructured":"Thomassen, C.: On the chromatic number of triangle-free graphs of large minimum degree. Combinatorica 22(4), 591\u2013596 (2002)","journal-title":"Combinatorica"},{"issue":"2","key":"207_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00493-007-0054-1","volume":"27","author":"C Thomassen","year":"2007","unstructured":"Thomassen, C.: On the chromatic number of pentagon-free graphs of large minimum degree. Combinatorica 27(2), 241\u2013243 (2007)","journal-title":"Combinatorica"},{"key":"207_CR13","unstructured":"Xue, Y.: A directed Andr\u00e1sfai-Erd\u0151s-S\u00f3s theorem and chromatic profiles of oriented cycles. arXiv preprint arXiv:2509.07760, (2025)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-026-00207-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-026-00207-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-026-00207-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T10:01:04Z","timestamp":1772618464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-026-00207-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s00493-026-00207-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,4]]},"assertion":[{"value":"7 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}