Ido Ben-Eliezer

activity

20092011

most citedPolynomial Threshold Functions: Structure, Approximation and Pseudorandomness

16 citations · 18 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2011

Biased orientation games

Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov

We study biased {\em orientation games}, in which the board is the complete graph $K_{n}$ , and Maker and Breaker take turns in directing previously undirected edges of $K_{n}$ . At the…

math.CO2010★ 1 cited

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 $0 < γ < 1/2$ we find a constant $c = c (γ)$ s…

math.CO2010★ 1 cited

The size Ramsey number of a directed path

Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov

Given a graph $H$ , the size Ramsey number $r_{e} (H, q)$ is the minimal number $m$ for which there is a graph $G$ with $m$ edges such that every $q$ -coloring of $G$ contains a monochro…