Search results
From Polymath Wiki
Jump to navigationJump to search
- == Kalai's Theorem == Here is an article by Gil Kalai on this subject: http://www.ma.huji.ac.il/~kalai/arr.pdf ...18 KB (3,011 words) - 09:21, 8 October 2011
- ...012/08/22/edp22-first-guest-post-from-gil-kalai/ First guest post from Gil Kalai] (Aug 22-26) ...012/08/27/edp23-second-guest-post-by-gil-kalai/ Second guest post from Gil Kalai] (Aug 27-30) ...29 KB (4,312 words) - 10:31, 21 September 2015
- '''Kalai.29:''' There is an analogous for Sperner but with high dimensional combinat '''Kalai.29:''' A sort of generic attack one can try with Sperner is to look at <mat ...4 KB (650 words) - 05:50, 17 February 2009
- ...02/08/dhj-quasirandomness-and-obstructions-to-uniformity/#comment-2114 Gil Kalai] and [http://gowers.wordpress.com/2009/02/08/dhj-quasirandomness-and-obstru ...20 KB (3,823 words) - 15:49, 22 August 2010
- * [KK] Gil Kalai and Daniel J. Kleitman, A quasi-polynomial bound for the diameter of graphs ...30 KB (5,420 words) - 13:31, 14 August 2011
- Miscellaneous contributors to the project include Gil Kalai. ...915 bytes (132 words) - 10:15, 3 April 2011
- ...rdpress.com/2013/09/20/polymath-8-a-success/ Polymath 8 – a Success!], Gil Kalai, 20 September 2013. ...44 KB (5,606 words) - 08:51, 11 July 2019
