bio | website | gilkalai.wordpress.com |
---|---|---|
location | Jerusalem | |
age | 59 | |
visits | member for | 5 years, 1 month |
seen | Dec 14 at 21:56 | |
stats | profile views | 17,269 |
Professor of Mathematics at the Hebrew University of Jerusalem and at Yale University
Dec 9 |
awarded | Good Question |
Dec 9 |
answered | Generalizations of the Four-Color theorem |
Dec 8 |
awarded | Popular Question |
Dec 7 |
awarded | Nice Question |
Dec 7 |
revised |
Generalizations of the Four-Color theorem
added 89 characters in body |
Dec 7 |
asked | Generalizations of the Four-Color theorem |
Dec 2 |
comment |
Bounding the absolute sum of entries of the inverse of a 0-1 matrix
(belated) Welcome to MO, Noga! |
Dec 2 |
comment |
lower-bound for $Pr[X\geq EX]$
Dear Fedja, This is a very nice proof, and especially the new nice trick to pass to exp (2Y) and what follows. As Ryan mentioned there is a nice conjecture by Uri Feige (in the paper) that the best bound is obtained when each of the n variables is n+1 with probability 1/(n+1). |
Nov 5 |
awarded | Yearling |
Sep 30 |
awarded | Explainer |
Sep 27 |
comment |
Characterizing faces of 3-dimensional polyhedra. (Related to Victor Eberhard's Theorem [1890]:)
Dear Kundor, as it turned out the question remains open. (I forgot to update.) |
Sep 27 |
revised |
Characterizing faces of 3-dimensional polyhedra. (Related to Victor Eberhard's Theorem [1890]:)
deleted 232 characters in body |
Aug 22 |
awarded | Good Answer |
Aug 13 |
revised |
How to find ICM talks?
added 85 characters in body |
Aug 13 |
awarded | Favorite Question |
Aug 11 |
revised |
A Conjecture About Directed Graphs that are the Union of Two Trees
added 410 characters in body |
Aug 9 |
awarded | Nice Answer |
Aug 6 |
awarded | Guru |
Aug 6 |
revised |
How to find ICM talks?
added 240 characters in body |
Jul 26 |
comment |
Stable matchings when switches have costs
Very nice question!! |