Shoham Letzter

activity

20132025

most citedPath Ramsey number for random graphs

52 citations · 155 across the 43 of their papers we have counts for

collaborators

Showing 2021Show all

4 papers · 1 filter

math.CO2021

Immersion of complete digraphs in Eulerian digraphs

António Girão, Shoham Letzter

A digraph $G$ \emph{immerses} a digraph $H$ if there is an injection $f : V (H) \to V (G)$ and a collection of pairwise edge-disjoint directed paths $P_{uv}$ , for $uv \in E (H)$ , such…

math.CO2021

Rainbow subdivisions of cliques

Tao Jiang, Shoham Letzter, Abhishek Methuku +1

We show that for every integer $m \geq 2$ and large $n$ , every properly edge-coloured graph on $n$ vertices with at least $n (lo g n)^{53}$ edges contains a rainbow subdivision of $…

math.CO2021

Hypergraphs with no tight cycles

Shoham Letzter

We show that every $r$ -uniform hypergraph on $n$ vertices which does not contain a tight cycle has at most $O (n^{r - 1} (lo g n)^{5})$ edges. This is an improvement on the previously b…

math.CO2021★ 4 cited

Size-Ramsey numbers of powers of hypergraph trees and long subdivisions

Shoham Letzter, Alexey Pokrovskiy, Liana Yepremyan

The $s$ -colour size-Ramsey number of a hypergraph $H$ is the minimum number of edges in a hypergraph $G$ whose every $s$ -edge-colouring contains a monochromatic copy of $H$ . We sho…