Combinatorial Convexity: A Wonderful New Book by Imre Bárány

A few days ago I received by mail Imre Bárány’s new book Combinatorial Convexity. The book presents Helly-type theorems and other results in convexity with combinatorial flavour. The choice of material and the choice of proofs is terrific and it is an ideal book for a course for graduate students and advanced undergraduates.  Congratulations, Imre!

The AMS page gives the following description

This book is about the combinatorial properties of convex sets, families of convex sets in finite dimensional Euclidean spaces, and finite points sets related to convexity. This area is classic, with theorems of Helly, Carathéodory, and Radon that go back more than a hundred years. At the same time, it is a modern and active field of research with recent results like Tverberg’s theorem, the colourful versions of Helly and Carathéodory, and the (p,q) theorem of Alon and Kleitman. As the title indicates, the topic is convexity and geometry, and is close to discrete mathematics. The questions considered are frequently of a combinatorial nature, and the proofs use ideas from geometry and are often combined with graph and hypergraph theory.

The book is intended for students (graduate and undergraduate alike), but postdocs and research mathematicians will also find it useful. It can be used as a textbook with short chapters, each suitable for a one- or two-hour lecture. Not much background is needed: basic linear algebra and elements of (hyper)graph theory as well as some mathematical maturity should suffice.

Here is also the Amzon page.


This entry was posted in Combinatorics, Convexity, Geometry and tagged . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s