{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T21:18:00Z","timestamp":1713388680025},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:00:00Z","timestamp":1573084800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2020,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that, with high probability, in every 2-edge-colouring of the random tournament on <jats:italic>n<\/jats:italic> vertices there is a monochromatic copy of every oriented tree of order <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" mimetype=\"image\" xlink:href=\"S0963548319000373_inline1.png\" \/><jats:tex-math>$O(n{\\rm{\/}}\\sqrt {{\\rm{log}} \\ n} )$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. This generalizes a result of the first, third and fourth authors, who proved the same statement for paths, and is tight up to a constant factor.<\/jats:p>","DOI":"10.1017\/s0963548319000373","type":"journal-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T09:22:37Z","timestamp":1573118557000},"page":"318-345","source":"Crossref","is-referenced-by-count":2,"title":["Monochromatic trees in random tournaments"],"prefix":"10.1017","volume":"29","author":[{"given":"Matija","family":"Buci\u0107","sequence":"first","affiliation":[]},{"given":"Sven","family":"Heberle","sequence":"additional","affiliation":[]},{"given":"Shoham","family":"Letzter","sequence":"additional","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,11,7]]},"reference":[{"key":"S0963548319000373_ref18","unstructured":"[18] Szemer\u00e9di, E. (1978) Regular partitions of graphs. In Probl\u00e8mes combinatoires et th\u00e9orie des graphes, Vol. 260 of Proc. Colloq. Internat. CNRS, pp. 399\u2013401."},{"key":"S0963548319000373_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01431439"},{"key":"S0963548319000373_ref6","first-page":"215","article-title":"On the magnitude of generalized Ramsey numbers for graphs","volume":"10","author":"Burr","year":"1975","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"S0963548319000373_ref15","unstructured":"[15] Ramsey, F. P. (1930) On a problem of formal logic. Proc. London Math. Soc. 30 264\u2013285."},{"key":"S0963548319000373_ref14","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19650280503"},{"key":"S0963548319000373_ref10","unstructured":"[10] Gallai, T. (1968) On directed paths and circuits. In Theory of Graphs (Proc. Colloq., Tihany, 1966) (P. Erd\u00f6s and G. Katona, eds), Academic Press, pp. 115\u2013118."},{"key":"S0963548319000373_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00184-2"},{"key":"S0963548319000373_ref11","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C"},{"key":"S0963548319000373_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018596"},{"key":"S0963548319000373_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90037-0"},{"key":"S0963548319000373_ref19","first-page":"758","article-title":"Determination of minimal coloring of vertices of a graph by means of Boolean powers of the incidence matrix","volume":"147","author":"Vitaver","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"S0963548319000373_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90077-6"},{"key":"S0963548319000373_ref17","first-page":"129","article-title":"Nombre chromatique et plus longs chemins d\u2019un graphe","volume":"1","author":"Roy","year":"1967","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"key":"S0963548319000373_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018597"},{"key":"S0963548319000373_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.10.002"},{"key":"S0963548319000373_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.008"},{"key":"S0963548319000373_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-012-2710-3"},{"key":"S0963548319000373_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2018.12.006"},{"key":"S0963548319000373_ref5","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20780"},{"key":"S0963548319000373_ref13","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/6.2.175"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548319000373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T10:26:59Z","timestamp":1590488819000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548319000373\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,7]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["S0963548319000373"],"URL":"https:\/\/doi.org\/10.1017\/s0963548319000373","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,7]]}}}