Simi Haber

I'm a PhD student in Tel Aviv university. My advisor is Prof. Michael Krivelevich.

I'm interested in combinatorics and logic, specifically in probabilistic combinatorics and finite model theory.

Online available papers

· S. Haber and M. Krivelevich, On fractional K-factors of random graphs.
Random Structures and Algorithms 30 (2007), 441-463.

· I. Benjamini, S. Haber, M. Krivelevich and E. Lubetzky, The isoperimetric constant of the random graph process.
Random Structures and Algorithms 32 (2008), 101-114.

· S. Haber and M. Krivelevich, The logic of random regular graphs.
Journal of Combinatorics 1 (2010), 389-440

· N. Alon, S. Haber and M. Krivelevich, The number of F-matchings in almost every tree is a zero residue.
Electronic Journal of Combinatorics, Volume 18 (1) (2011), publication P30

· S. Haber and S. Shelah, Natural extensions of the first order language of graphs. (preprint, only proofs)

· S. Haber and T. Muller, On the logic of random geometric graphs. (preprint)