52 citations · 155 across the 43 of their papers we have counts for
8 papers · 1 filter
Product-free sets in the free semigroup
Imre Leader, Shoham Letzter, Bhargav Narayanan +1
In this paper, we study product-free subsets of the free semigroup over a finite alphabet . We prove that the maximum density of a product-free subset of the free semigroup over…
Many -copies in graphs with a forbidden tree
Shoham Letzter
For graphs and , let be the maximum possible number of copies of in an -free graph on vertices. The study of this function, which gen…
Dense induced bipartite subgraphs in triangle-free graphs
Matthew Kwan, Shoham Letzter, Benny Sudakov +1
The problem of finding dense induced bipartite subgraphs in -free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we ob…
Monochromatic trees in random tournaments
Matija Bucic, Sven Heberle, Shoham Letzter +1
We prove that, with high probability, in every -edge-colouring of the random tournament on vertices there is a monochromatic copy of every oriented tree of order $O (n / \sq…
Cycle partitions of regular graphs
Vytautas Gruslys, Shoham Letzter
Magnant and Martin conjectured that the vertex set of any -regular graph on vertices can be partitioned into paths (there exists a simple construction showin…
Hypergraph Lagrangians I: the Frankl-Füredi conjecture is false
Vytautas Gruslys, Shoham Letzter, Natasha Morrison
An old and well-known conjecture of Frankl and Füredi states that the Lagrangian of an -uniform hypergraph with edges is maximised by an initial segment of colex. In this pa…