Cuts are well-known objects in graph theory, combinatorics, and combinatorial optimization and, perhaps less well-known, in analysis and probability theory. Featuring a rigorous use of cut polyhedra, this book summarizes various results in all these areas in a unified way, and points out unnoticed relations between diverse results in these fields.