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 2016Show all

4 papers · 1 filter

math.CO2016★ 4 cited

Almost partitioning the hypercube into copies of a graph

Vytautas Gruslys, Shoham Letzter

Let $H$ be an induced subgraph of the hypercube $Q_{k}$ , for some $k$ . We show that for some $c = c (H)$ , the vertices of $Q_{n}$ can be partitioned into induced copies of $H$ and a rem…

math.CO2016★ 1 cited

The homomorphism threshold of ${C_{3}, C_{5}}$ -free graphs

Shoham Letzter, Richard Snyder

We determine the structure of ${C_{3}, C_{5}}$ -free graphs with $n$ vertices and minimum degree larger than $n /5$ : such graphs are homomorphic to the graph obtained from a $(5 k - 3)$ …

math.CO2016

Eigenvalues of subgraphs of the cube

Béla Bollobás, Jonathan Lee, Shoham Letzter

We consider the problem of maximising the largest eigenvalue of subgraphs of the hypercube $Q_{d}$ of a given order. We believe that in most cases, Hamming balls are maximisers, and…

math.CO2016★ 2 cited

Minimising the number of triangular edges

Vytautas Gruslys, Shoham Letzter

We consider the problem of minimising the number of edges that are contained in triangles, among $n$ -vertex graphs with a given number of edges. We prove a conjecture of Füredi and…

Almost partitioning the hypercube into copies of a graph

The homomorphism threshold of {C3​,C5​}-free graphs

Eigenvalues of subgraphs of the cube

Minimising the number of triangular edges

The homomorphism threshold of ${C_{3}, C_{5}}$ -free graphs