Imre Bárány explores combinatorial questions about convex sets and finite point configurations.
This text connects convex geometry with discrete mathematics, considering families of convex sets in finite-dimensional Euclidean spaces. It brings classical results associated with Helly, Carathéodory and Radon into a wider account of the field.
The discussion also addresses later developments and methods involving graphs and hypergraphs. It is intended for students and research mathematicians interested in combinatorial aspects of geometry.