Interview with Gil Kalai
From MaRDI portal
Cites work
- A counterexample to Borsuk’s conjecture
- A simple proof of the upper bound theorem
- An extended Euler-Poincaré theorem
- Analysis of Boolean Functions
- Every monotone graph property has a sharp threshold
- Helly-type problems
- scientific article; zbMATH DE number 4063945 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- Illuminating sets of constant width
- Influences in Product Spaces: KKL and BKKKL Revisited
- Intersection patterns of convex sets
- Kleitman and combinatorics
- On Kalai's conjectures concerning centrally symmetric polytopes
- On the number of faces of centrally-symmetric simplicial polytopes
- The dimension of almost spherical sections of convex bodies
- The number of faces of centrally-symmetric polytopes
- The strong perfect graph theorem
- Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.
This page was built for publication: Interview with Gil Kalai
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098016)