Author:
Bucić Matija,Heberle Sven,Letzter Shoham,Sudakov Benny
Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference20 articles.
1. [18] Szemerédi, E. (1978) Regular partitions of graphs. In Problèmes combinatoires et théorie des graphes, Vol. 260 of Proc. Colloq. Internat. CNRS, pp. 399–401.
2. A Ramsey-type problem for paths in digraphs
3. On the magnitude of generalized Ramsey numbers for graphs;Burr;Colloq. Math. Soc. János Bolyai,1975
4. [15] Ramsey, F. P. (1930) On a problem of formal logic. Proc. London Math. Soc. 30 264–285.
5. Zur algebraischen Begründung der Graphentheorie. I
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献