52 citations · 155 across the 43 of their papers we have counts for
58 papers
Exact supported co-degree bounds for Hamilton cycles
Shoham Letzter, Arjun Ranganathan
For any and such that , we show that any sufficiently large -graph must contain a Hamilton -cycle provided that it has no…
On the gracesize of trees
Shoham Letzter, Alexey Pokrovskiy, Ella Williams
An -vertex tree is said to be if there exists a bijective labelling such that the edge-differences $\{|ϕ(x)-ϕ(y)| : xy\in E(T)…
Packing subgraphs in regular graphs
Shoham Letzter, Abhishek Methuku, Benny Sudakov
An \emph{-packing} in a graph is a collection of pairwise vertex-disjoint copies of in . We prove that for every and every bipartite graph , any $\lfloor c…
Size-Ramsey numbers of tight paths
Shoham Letzter, Alexey Pokrovskiy, Liana Yepremyan
The -colour size-Ramsey number of a hypergraph is the minimum number of edges in a hypergraph whose every -edge-colouring contains a monochromatic copy of . We sho…
Nearly Hamilton cycles in sublinear expanders, and applications
Shoham Letzter, Abhishek Methuku, Benny Sudakov
We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in gen…
Building graphs with high minimum degree on a budget
Kyriakos Katsamaktsis, Shoham Letzter
We consider the problem of constructing a graph of minimum degree in the following controlled random graph process, introduced recently by Frieze, Krivelevich and Michaeli…