{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:19:25Z","timestamp":1781075965598,"version":"3.54.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T00:00:00Z","timestamp":1662681600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T00:00:00Z","timestamp":1662681600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["CCF-2006363"],"award-info":[{"award-number":["CCF-2006363"]}],"id":[{"id":"10.13039\/100000083","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":[[2022,10]]},"DOI":"10.1007\/s00373-022-02560-5","type":"journal-article","created":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T12:37:36Z","timestamp":1662727056000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tighter Bounds on Directed Ramsey Number R(7)"],"prefix":"10.1007","volume":"38","author":[{"given":"David","family":"Neiman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Mackey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5587-8801","authenticated-orcid":false,"given":"Marijn","family":"Heule","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,9]]},"reference":[{"key":"2560_CR1","unstructured":"Armin, Biere, CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT Entering the SAT Competition 2018. In  Proc.\u00a0of SAT Competition 2018 \u2013 Solver and Benchmark Descriptions, volume B-2018-1 of  Department of Computer Science Series of Publications B, pages 13\u201314. University of Helsinki, 2018"},{"key":"2560_CR2","doi-asserted-by":"crossref","unstructured":"Niklas E\u00e9n, Armin Biere. Effective preprocessing in SAT through variable and clause elimination. In Fahiem Bacchus and Toby Walsh, editors,  Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, volume 3569 of  Lecture Notes in Computer Science, pages 61\u201375. Springer, 2005","DOI":"10.1007\/11499107_5"},{"key":"2560_CR3","first-page":"125","volume":"9","author":"Paul Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, Paul, Moser, Leo: On the representation of directed graphs as unions of orderings. Math. Inst. Hung. Acad. Sci 9, 125\u2013132 (1964)","journal-title":"Math. Inst. Hung. Acad. Sci"},{"key":"2560_CR4","unstructured":"Ian\u00a0P, Gent. Arc consistency in SAT. In Frank van Harmelen, editor,  Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI\u20192002, Lyon, France, July 2002, pages 121\u2013125. IOS Press, 2002"},{"issue":"4","key":"2560_CR5","doi-asserted-by":"publisher","first-page":"2328","DOI":"10.1137\/18M1169473","volume":"35","author":"Bernard Lidicky","year":"2021","unstructured":"Lidicky, Bernard, Pfender, Florian: Semidefinite programming and ramsey numbers. SIAM J. Discret. Math. 35(4), 2328\u20132344 (2021)","journal-title":"SIAM J. Discret. Math."},{"key":"2560_CR6","unstructured":"Evan Lohn, Chris Lambert, Marijn J.H. Heule. Compact symmetry breaking for tournaments. In  Proceedings of FMCAD 2022, 2022"},{"key":"2560_CR7","unstructured":"Brendan McKay. Digraphs. http:\/\/users.cecs.anu.edu.au\/~bdm\/data\/digraphs.html. Accessed: 2019 Sep 30"},{"key":"2560_CR8","unstructured":"John W. Moon.  Topics on tournaments in graph theory. Courier Dover Publications, 2015"},{"issue":"2\u20134","key":"2560_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02986687","volume":"10","author":"Adolfo Sanchez-Flores","year":"1994","unstructured":"Sanchez-Flores, Adolfo: On tournaments and their largest transitive subtournaments. Graphs Combinatorics 10(2\u20134), 367\u2013376 (1994)","journal-title":"Graphs Combinatorics"},{"issue":"2","key":"2560_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s003730050025","volume":"14","author":"Adolfo Sanchez-Flores","year":"1998","unstructured":"Sanchez-Flores, Adolfo: On tournaments free of large transitive subtournaments. Graphs Combinatorics 14(2), 181\u2013200 (1998)","journal-title":"Graphs Combinatorics"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02560-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02560-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02560-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:44:51Z","timestamp":1667418291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02560-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,9]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2560"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02560-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,9]]},"assertion":[{"value":"19 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"156"}}