Shoham Letzter

collaborators

11 papers

math.CO2026

Pancyclicity of highly connected graphs

Shoham Letzter

A well-known result due to ChvatÃ¡l and ErdÅs (1972) asserts that, if a graph $G$ satisfies $I^º (G) \geq I^\pm (G)$ , where $I^º (G)$ is the vertex-connectivity of $G$ , then $G$ has a Hami…

math.CO2026

Packing subgraphs in regular graphs

Shoham Letzter, Abhishek Methuku, Benny Sudakov

An \emph{ $H$ -packing} in a graph $G$ is a collection of pairwise vertex-disjoint copies of $H$ in $G$ . We prove that for every $c > 0$ and every bipartite graph $H$ , any $\lfloor c…

math.CO2026

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…

math.CO2025

Exact supported co-degree bounds for Hamilton cycles

Shoham Letzter, Arjun Ranganathan

For any $k \geq 3$ and $ℓ \in [k - 1]$ such that $(k, ℓ) \neq = (3, 1)$ , we show that any sufficiently large $k$ -graph $G$ must contain a Hamilton $ℓ$ -cycle provided that it has no…

math.CO2025

On the gracesize of trees

Shoham Letzter, Alexey Pokrovskiy, Ella Williams

An $n$ -vertex tree $T$ is said to be $graceful$ if there exists a bijective labelling $I ¨ : V (T) \to {1, \dots, n}$ such that the edge-differences $\{|Ï(x)-Ï(y)| : xy\in E…

math.CO2025

Rainbow subgraphs of uniformly coloured randomly perturbed graphs

Kyriakos Katsamaktsis, Shoham Letzter, Amedeo Sgueglia

For a given $I^´ \in (0, 1)$ , the randomly perturbed graph model is defined as the union of any $n$ -vertex graph $G_{0}$ with minimum degree $I^´ n$ and the binomial random graph $\mathbf…