Show simple item record

dc.contributor.author
Bucić, Matija
dc.contributor.author
Heberle, Sven
dc.contributor.author
Letzter, Shoham
dc.contributor.author
Sudakov, Benny
dc.date.accessioned
2021-03-17T06:34:41Z
dc.date.available
2020-10-28T03:49:43Z
dc.date.available
2020-11-02T14:30:59Z
dc.date.available
2021-03-17T06:34:41Z
dc.date.issued
2020-05
dc.identifier.issn
0963-5483
dc.identifier.issn
1469-2163
dc.identifier.other
10.1017/S0963548319000373
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/448248
dc.description.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/ 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.
en_US
dc.language.iso
en
en_US
dc.publisher
Cambridge University Press
en_US
dc.title
Monochromatic trees in random tournaments
en_US
dc.type
Journal Article
dc.date.published
2019-11-07
ethz.journal.title
Combinatorics Probability & Computing
ethz.journal.volume
29
en_US
ethz.journal.issue
3
en_US
ethz.pages.start
318
en_US
ethz.pages.end
345
en_US
ethz.grant
Extremal problems in combinatorics
en_US
ethz.identifier.wos
ethz.publication.place
Cambridge
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02000 - Dep. Mathematik / Dep. of Mathematics::02502 - Institut für Operations Research / Institute for Operations Research::03993 - Sudakov, Benjamin / Sudakov, Benjamin
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02000 - Dep. Mathematik / Dep. of Mathematics::02502 - Institut für Operations Research / Institute for Operations Research::03993 - Sudakov, Benjamin / Sudakov, Benjamin
ethz.grant.agreementno
175573
ethz.grant.fundername
SNF
ethz.grant.funderDoi
10.13039/501100001711
ethz.grant.program
Projektförderung in Mathematik, Natur- und Ingenieurwissenschaften (Abteilung II)
ethz.date.deposited
2020-10-28T03:49:48Z
ethz.source
WOS
ethz.eth
yes
en_US
ethz.availability
Metadata only
en_US
ethz.rosetta.installDate
2020-11-02T14:31:10Z
ethz.rosetta.lastUpdated
2021-02-15T19:40:49Z
ethz.rosetta.exportRequired
true
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Monochromatic%20trees%20in%20random%20tournaments&rft.jtitle=Combinatorics%20Probability%20&%20Computing&rft.date=2020-05&rft.volume=29&rft.issue=3&rft.spage=318&rft.epage=345&rft.issn=0963-5483&1469-2163&rft.au=Buci%C4%87,%20Matija&Heberle,%20Sven&Letzter,%20Shoham&Sudakov,%20Benny&rft.genre=article&rft_id=info:doi/10.1017/S0963548319000373&
 Search print copy at ETH Library

Files in this item

FilesSizeFormatOpen in viewer

There are no files associated with this item.

Publication type

Show simple item record