52 citations · 155 across the 43 of their papers we have counts for
5 papers · 1 filter
The oriented size Ramsey number of directed paths
Shoham Letzter, Benny Sudakov
An oriented graph is a directed graph with no bi-directed edges, i.e. if is an edge then is not an edge. The oriented size Ramsey number of an oriented graph , denoted…
On Existentially Complete Triangle-free Graphs
Shoham Letzter, Julian Sahasrabudhe
For a positive integer , we say that a graph is -existentially complete if for every , and every tuple of distinct vertices , $y_1,\ldots,y_{…
Partitioning a graph into monochromatic connected subgraphs
António Girão, Shoham Letzter, Julian Sahasrabudhe
A well-known result by Haxell and Kohayakawa states that the vertices of an -coloured complete graph can be partitioned into monochromatic connected subgraphs of distinct co…
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…
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…