Combinatorics with a Geometric Flavor
Gil Kalai · Birkhäuser Basel eBooks · 2000
In this paper I try to present my field, combinatorics, via five examples of combinatorial studies which have some geometric flavor. The first topic is Tverberg’s theorem, a gem in combinatorial geometry, and various of its combinatorial and topological extensions. McMullen’s upper bound theorem for the face numbers of convex polytopes and its many extensions is the second topic. Next are general properties of subsets of the vertices of the discrete n -dimensional cube and some relations with questions of extremal and probabilistic combinatorics. Our fourth topic is tree enumeration and random spanning trees, and finally, some combinatorial and geometrical aspects of the simplex method for linear programming are considered. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.