52 citations · 155 across the 43 of their papers we have counts for
8 papers · 1 filter
Large rainbow cliques in randomly perturbed dense graphs
Elad Aigner-Horev, Oran Danon, Dan Hefetz +1
For two graphs and , write if has the property that every {\sl proper} colouring of its edges yields a {\sl rainbow} copy…
Optimal Adaptive Detection of Monotone Patterns
Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten
We investigate adaptive sublinear algorithms for detecting monotone patterns in an array. Given fixed and , consider the problem of findi…
Finding monotone patterns in sublinear time
Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter +1
We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed and , we show that the n…
Lagrangians of Hypergraphs II: When colex is best
Vytautas Gruslys, Shoham Letzter, Natasha Morrison
A well-known conjecture of Frankl and Füredi from 1989 states that an initial segment of colex of has the largest Lagrangian of any -uniform hypergraph with hyperedges. We s…
The size-Ramsey number of 3-uniform tight paths
Jie Han, Yoshiharu Kohayakawa, Shoham Letzter +2
Given a hypergraph , the size-Ramsey number is the smallest integer such that there exists a graph with edges with the property that in any colouring…
Orthonormal representations of -free graphs
Igor Balla, Shoham Letzter, Benny Sudakov
Let be unit vectors such that among any three there is an orthogonal pair. How large can be as a function of , and how large can the leng…