随机比赛中的单色树

Combinatorics, Probability and Computing Pub Date : 2018-09-19 DOI:10.1017/S0963548319000373

Matija Bucić, Sven Heberle, Shoham Letzter, B. Sudakov

{"title":"随机比赛中的单色树","authors":"Matija Bucić, Sven Heberle, Shoham Letzter, B. Sudakov","doi":"10.1017/S0963548319000373","DOIUrl":null,"url":null,"abstract":"Abstract We prove that, with high probability, in every 2-edge-colouring of the random tournament on n vertices there is a monochromatic copy of every oriented tree of order $O(n{\\rm{/}}\\sqrt {{\\rm{log}} \\ n} )$. 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.","PeriodicalId":10503,"journal":{"name":"Combinatorics, Probability and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Monochromatic trees in random tournaments\",\"authors\":\"Matija Bucić, Sven Heberle, Shoham Letzter, B. Sudakov\",\"doi\":\"10.1017/S0963548319000373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We prove that, with high probability, in every 2-edge-colouring of the random tournament on n vertices there is a monochromatic copy of every oriented tree of order $O(n{\\\\rm{/}}\\\\sqrt {{\\\\rm{log}} \\\\ n} )$. 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.\",\"PeriodicalId\":10503,\"journal\":{\"name\":\"Combinatorics, Probability and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorics, Probability and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/S0963548319000373\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorics, Probability and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/S0963548319000373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

摘要:我们证明了在n个顶点的随机竞赛的每一个2边着色中，有很大的概率存在一个阶$O(n{\rm{/}}\sqrt {{\rm{log}} \ n})$的每个有向树的单色副本。这推广了第一，第三和第四作者的结果，他们证明了路径的相同陈述，并且紧密到一个常数因子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Monochromatic trees in random tournaments

Abstract We prove that, with high probability, in every 2-edge-colouring of the random tournament on n vertices there is a monochromatic copy of every oriented tree of order $O(n{\rm{/}}\sqrt {{\rm{log}} \ n} )$. 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Combinatorics, Probability and Computing

自引率

0.00%

发文量