{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T05:28:43Z","timestamp":1732166923576,"version":"3.28.0"},"reference-count":14,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[2025,1]]},"abstract":"ABSTRACT<\/jats:title>Recently, Dragani\u0107, Munh\u00e1 Correia, Sudakov and Yuster\u00a0(2022)\u00a0showed that every tournament on vertices contains a 1\u2010subdivision of a transitive tournament on vertices, which is tight up to a constant factor. We prove a counterpart of their result for immersions. Let be the smallest integer such that any tournament on at least vertices must contain a 1\u2010immersion of a transitive tournament on vertices. We show that , which is clearly tight up to a multiplicative factor. If one insists on finding an immersion of a complete directed graph on vertices, then an extra condition on the tournament is necessary. Indeed, we show that every tournament with minimum out\u2010degree at least must contain a 2\u2010immersion of a complete digraph on vertices. This is again tight up to the value of and tight on the order of the paths in the immersion.<\/jats:p>","DOI":"10.1002\/rsa.21269","type":"journal-article","created":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T12:39:24Z","timestamp":1732106364000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Immersions of Directed Graphs in Tournaments"],"prefix":"10.1002","volume":"66","author":[{"given":"Ant\u00f3nio","family":"Gir\u00e3o","sequence":"first","affiliation":[{"name":"Mathematical Institute University of Oxford Oxford UK"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1548-5974","authenticated-orcid":false,"given":"Robert","family":"Hancock","sequence":"additional","affiliation":[{"name":"Mathematical Institute University of Oxford Oxford UK"}]}],"member":"311","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2022.06.001"},{"issue":"3","key":"e_1_2_7_3_1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01261316","article-title":"Highly Linked Graphs","volume":"16","author":"Bollob\u00e1s B.","year":"1996","journal-title":"Combinatorica"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830000184X"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2806-z"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2022.07.008"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2020.09.006"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(85)80025-1"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579379"},{"key":"e_1_2_7_10_1","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.jctb.2018.05.004","article-title":"Immersion of Transitive Tournaments in Digraphs With Large Minimum Outdegree","volume":"134","author":"Lochet W.","year":"2019","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"e_1_2_7_11_1","first-page":"214","article-title":"On the Magnitude of Generalized Ramsey Numbers for Graphs, Infinite and Finite Sets (Colloq., Keszthely, 1973; Dedicated to P. Erd\u0151s on His 60th Birthday)","volume":"1","author":"Burr S. A.","year":"1975","journal-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190180406"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303005741"},{"key":"e_1_2_7_14_1","volume-title":"The Probabilistic Method","author":"Alon N.","year":"2016"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-023-2572-y"}],"container-title":["Random Structures & Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.21269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T12:39:28Z","timestamp":1732106368000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.21269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1002\/rsa.21269"],"URL":"https:\/\/doi.org\/10.1002\/rsa.21269","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"2024-01-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}