Books & papers

Recommended reading

A selection from the reading list on the original site.

L. Babai and P. Frankl

Linear algebra methods in combinatorics

Linear-algebraic approaches to combinatorial problems.

J. Matoušek

Using the Borsuk–Ulam Theorem

Topological methods in discrete geometry.

K. Ball

An elementary introduction to modern convex geometry

Flavors of Geometry, MSRI Publications (1997).

Read / find a copy ↗

L. Lovász

On the Shannon capacity of a graph

IEEE Transactions on Information Theory 25 (1979), 1–7.

I. Bárány

A Generalization of Carathéodory’s Theorem

Discrete Mathematics 40 (1982), 141–152.

D. Lubell

A short proof of Sperner’s lemma

Journal of Combinatorial Theory 1 (1966), 299.