20 citations · 64 across the 12 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 6 cited
Directed Ramsey number for trees
Matija Bucic, Shoham Letzter, Benny Sudakov
In this paper, we study Ramsey-type problems for directed graphs. We first consider the -colour oriented Ramsey number of , denoted by , which is the…
math.CO2017★ 15 cited
Monochromatic paths in random tournaments
Matija Bucić, Shoham Letzter, Benny Sudakov
We prove that, with high probability, any -edge-colouring of a random tournament on vertices contains a monochromatic path of length . This resolves a…
math.CO2017★ 20 cited
An improved bound for disjoint directed cycles
Matija Bucić
We show that every directed graph with minimum out-degree at least contains at least vertex disjoint cycles. This is an improvement over the result of Alon who showed thi…