papers
Publications (7)
math.LO2015
Random graphs and Lindstrom quantifiers for natural graph properties
Simi Haber, Saharon Shelah
math.CO2010
The number of F-matchings in almost every tree is a zero residue
Noga Alon, Simi Haber, Michael Krivelevich
math.CO2018
On the game chromatic number of sparse random graphs
Alan Frieze, Simi Haber, Mikhail Lavrov
math.LO2015
An extension of the Ehrenfeucht-Fraisse game for first order logics augmented with Lindstrom quantifiers
Simi Haber, Saharon Shelah
math.CO2012
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
Alan Frieze, Simi Haber
cond-mat.stat-mech2018
Ferromagnetic Potts models with multisite interaction
Nir Schreiber, Reuven Cohen, Simi Haber
math.PR2005
The isoperimetric constant of the random graph process
Itai Benjamini, Simi Haber, Michael Krivelevich +1