Sonny Ben-Shimon

According to our database, Sonny Ben-Shimon authored at least 8 papers between 2007 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2011

On the robustness of random and pseudo-random graphs

Sonny Ben-Shimon

PhD thesis, 2011

On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs.

Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov

SIAM J. Discret. Math., 2011

Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs.

Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov

Comb. Probab. Comput., 2011

Hitting time results for Maker-Breaker games.

Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

A note on regular Ramsey graphs.

Noga Alon, Sonny Ben-Shimon, Michael Krivelevich

J. Graph Theory, 2010

2009

Vertex percolation on expander graphs.

Sonny Ben-Shimon, Michael Krivelevich

Eur. J. Comb., 2009

Random regular graphs of non-constant degree: Concentration of the chromatic number.

Sonny Ben-Shimon, Michael Krivelevich

Discret. Math., 2009

2007

Message passing for the coloring problem: Gallager meets Alon and Kahale.

Sonny Ben-Shimon, Dan Vilenchik

CoRR, 2007