☰

Gil Kalai - Publications

Affiliations: 
Mathematics Yale University, New Haven, CT 
Tree Info Similar researchers PubMed Report error

42 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Kalai G, Novik I, Santos F, Welker V. Geometric, Algebraic, and Topological Combinatorics Oberwolfach Reports. 16: 2395-2472. DOI: 10.4171/Owr/2019/39  0.338
2020 Ellis D, Kalai G, Narayanan B. On symmetric intersecting families European Journal of Combinatorics. 86: 103094. DOI: 10.1016/J.Ejc.2020.103094  0.335
2020 Kalai G, Patáková Z. Intersection patterns of planar sets Discrete and Computational Geometry. 64: 304-323. DOI: 10.1007/S00454-020-00205-Z  0.344
2019 Kalai G, Schulman LJ. Quasi-random multilinear polynomials Israel Journal of Mathematics. 230: 195-211. DOI: 10.1007/S11856-018-1821-Y  0.367
2018 Friedgut E, Kahn J, Kalai G, Keller N. Chvátal's conjecture and correlation inequalities Journal of Combinatorial Theory, Series A. 156: 22-43. DOI: 10.1016/J.Jcta.2017.11.015  0.349
2016 Chudnovsky M, Kalai G, Nevo E, Novik I, Seymour P. Bipartite minors Journal of Combinatorial Theory. Series B. 116: 219-228. DOI: 10.1016/J.Jctb.2015.08.001  0.341
2015 Kalai G, Novik I, Santos F, Welker V. Geometric and Algebraic Combinatorics Oberwolfach Reports. 12: 285-368. DOI: 10.4171/Owr/2015/5  0.338
2015 Kalai G, Mossel E. Sharp thresholds for monotone non-boolean functions and social choice theory Mathematics of Operations Research. 40: 915-925. DOI: 10.1287/Moor.2014.0703  0.37
2011 Friedgut E, Kalai G, Keller N, Nisan N. A quantitative version of the gibbard-satterthwaite theorem for three alternatives Siam Journal On Computing. 40: 934-952. DOI: 10.1137/090756740  0.323
2008 Kalai G, Meshulam R. Leray numbers of projections and a topological Helly-type theorem Journal of Topology. 1: 551-556. DOI: 10.1112/Jtopol/Jtn010  0.349
2008 Kalai G, Wigderson A. Neighborly embedded manifolds Discrete and Computational Geometry. 40: 319-324. DOI: 10.1007/S00454-008-9065-Y  0.376
2007 Kahn J, Kalai G. Thresholds and expectation thresholds Combinatorics Probability and Computing. 16: 495-502. DOI: 10.1017/S0963548307008474  0.336
2006 Kalai G, Meshulam R. Intersections of Leray complexes and regularity of monomial ideals Journal of Combinatorial Theory. Series A. 113: 1586-1592. DOI: 10.1016/J.Jcta.2006.01.005  0.325
2005 Kalai G, Meshulam R. A topological colorful Helly theorem Advances in Mathematics. 191: 305-311. DOI: 10.1016/J.Aim.2004.03.009  0.405
2003 Benjamini I, Kalai G, Schramm O. First passage percolation has sublinear distance variance Annals of Probability. 31: 1970-1978. DOI: 10.1007/978-1-4419-9675-6_26  0.302
2002 Alon N, Kalai G, Matoušek J, Meshulam R. Transversal numbers for hypergraphs arising in geometry Advances in Applied Mathematics. 29: 79-101. DOI: 10.1016/S0196-8858(02)00003-9  0.368
2000 Meisinger G, Kleinschmidt P, Kalai G. Three theorems, with computer-aided proofs, on three-dimensional faces and quotients of polytopes Discrete and Computational Geometry. 24: 413-420. DOI: 10.1007/S004540010045  0.34
1999 Benjamini I, Kalai G, Schramm O. Noise sensitivity of Boolean functions and applications to percolation Publications MathéMatiques De L'Institut Des Hautes Scientifiques. 90: 5-43. DOI: 10.1007/978-1-4419-9675-6_12  0.307
1997 Kalai G, Matoušek J. Guarding galleries where every point sees a large area Israel Journal of Mathematics. 101: 125-139. DOI: 10.1007/Bf02760925  0.309
1996 Friedgut E, Kalai G. Every monotone graph property has a sharp threshold Proceedings of the American Mathematical Society. 124: 2993-3002.  0.318
1995 Alon N, Kalai G. Bounding the piercing number Discrete & Computational Geometry. 13: 245-256. DOI: 10.1007/Bf02574042  0.36
1994 Alon N, Kalai G, Ricklin M, Stockmeyer L. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling Theoretical Computer Science. 130: 175-201. DOI: 10.1016/0304-3975(94)90158-9  0.309
1994 Kahn J, Kalai G. A problem of Füredi and Seymour on covering intersecting families by pairs Journal of Combinatorial Theory, Series A. 68: 317-339. DOI: 10.1016/0097-3165(94)90109-0  0.357
1993 Kahn J, Kalai G. A counterexample to Borsuk’s conjecture Bulletin of the American Mathematical Society. 29: 60-62. DOI: 10.1090/S0273-0979-1993-00398-7  0.356
1992 Kalai G, Kleitman DJ. A quasi-polynomial bound for the diameter of graphs of polyhedra Bulletin of the American Mathematical Society. 26: 315-316. DOI: 10.1090/S0273-0979-1992-00285-9  0.386
1992 Bourgain J, Kahn J, Kalai G, Katznelson Y, Linial N. The influence of variables in product spaces Israel Journal of Mathematics. 77: 55-64. DOI: 10.1007/Bf02808010  0.373
1992 Kalai G. Upper bounds for the diameter and height of graphs of convex polyhedra Discrete & Computational Geometry. 8: 363-372. DOI: 10.1007/Bf02293053  0.404
1990 Kalai G. On low-dimensional faces that high-dimensional polytopes must have Combinatorica. 10: 271-280. DOI: 10.1007/Bf02122781  0.331
1988 Kalai G. A simple way to tell a simple polytope from its graph Journal of Combinatorial Theory, Series A. 49: 381-383. DOI: 10.1016/0097-3165(88)90064-7  0.335
1988 Kalai G. A new basis of polytopes Journal of Combinatorial Theory, Series A. 49: 191-209. DOI: 10.1016/0097-3165(88)90051-9  0.374
1988 Björner A, Kalai G. An extended Euler-Poincaré theorem Acta Mathematica. 161: 279-303. DOI: 10.1007/Bf02392300  0.335
1988 Kalai G. Many triangulated spheres Discrete & Computational Geometry. 3: 1-14. DOI: 10.1007/Bf02187893  0.35
1987 Kalai G. Rigidity and the lower bound theorem 1 Inventiones Mathematicae. 88: 125-151. DOI: 10.1007/Bf01405094  0.359
1986 Kalai G. Characterization of f-vectors of families of convex sets in Rd part II: Sufficiency of Eckhoff's conditions Journal of Combinatorial Theory, Series A. 41: 167-188. DOI: 10.1016/0097-3165(86)90079-8  0.378
1985 Alon NM, Kalai G. A Simple Proof of the Upper Bound Theorem European Journal of Combinatorics. 6: 211-214. DOI: 10.1016/S0195-6698(85)80029-9  0.394
1984 Kalai G. Weakly Saturated Graphs are Rigid North-Holland Mathematics Studies. 87: 189-190. DOI: 10.1016/S0304-0208(08)72824-X  0.359
1984 Alon N, Friedland S, Kalai G. Every 4-regular graph plus an edge contains a 3-regular subgraph Journal of Combinatorial Theory, Series B. 37: 92-93. DOI: 10.1016/0095-8956(84)90048-0  0.311
1984 Alon N, Friedland S, Kalai G. Regular subgraphs of almost regular graphs Journal of Combinatorial Theory, Series B. 37: 79-91. DOI: 10.1016/0095-8956(84)90047-9  0.311
1984 Kalai G. Characterization of f-vectors of families of convex sets in R d Part I: Necessity of Eckhoff's conditions Israel Journal of Mathematics. 48: 175-195. DOI: 10.1007/Bf02761163  0.415
1984 Kalai G. Intersection patterns of convex sets Israel Journal of Mathematics. 48: 161-174. DOI: 10.1007/Bf02761162  0.363
1983 Kalai G. Enumeration of Q-acyclic simplicial complexes Israel Journal of Mathematics. 45: 337-351. DOI: 10.1007/Bf02804017  0.361
1980 Kalai G. Analogues for Sperner and Erdös-Ko-Rado Theorems For Subspaces of Linear Spaces Annals of Discrete Mathematics. 9: 135. DOI: 10.1016/S0167-5060(08)70049-9  0.334
Show low-probability matches.