How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications) - Hardcover

Inhaltsangabe

Completely revised, this text shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. They present proofs of key results as well as numerous worked examples. This second edition includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet’s pigeonhole principle, Ramsey theory, and rook polynomials. It also contains 450 paired exercises, along with a full solution to one of the exercises in each pair. A solutions manual is available upong qualifying course adoption.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.