Interview with Gil Kalai
From MaRDI portal
Publication:6098016
DOI10.54550/eca2022v2s2i7zbMath1511.01032MaRDI QIDQ6098016
Publication date: 9 June 2023
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Intersection patterns of convex sets
- The number of faces of centrally-symmetric polytopes
- The strong perfect graph theorem
- On Kalai's conjectures concerning centrally symmetric polytopes
- A simple proof of the upper bound theorem
- On the number of faces of centrally-symmetric simplicial polytopes
- An extended Euler-Poincaré theorem
- The dimension of almost spherical sections of convex bodies
- Kleitman and combinatorics
- A counterexample to Borsuk’s conjecture
- Illuminating sets of constant width
- Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen.
- Every monotone graph property has a sharp threshold
- Influences in Product Spaces: KKL and BKKKL Revisited
- Analysis of Boolean Functions
- Helly-type problems
This page was built for publication: Interview with Gil Kalai