16 citations · 18 across the 4 of their papers we have counts for
4 papers
Biased orientation games
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
We study biased {\em orientation games}, in which the board is the complete graph , and Maker and Breaker take turns in directing previously undirected edges of . At the…
Long cycles in subgraphs of (pseudo)random directed graphs
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every we find a constant s…
The size Ramsey number of a directed path
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
Given a graph , the size Ramsey number is the minimal number for which there is a graph with edges such that every -coloring of contains a monochro…
Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness
Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the…