How to Count: An Introduction to Combinatorics, Second Edition

2nd Edition

R.B.J.T. Allenby, Alan Slomson

Chapman and Hall/CRC
Published August 12, 2010
Textbook - 444 Pages - 164 B/W Illustrations
ISBN 9781420082609 - CAT# C8260

For Instructors Request Inspection Copy


Add to Wish List
FREE Standard Shipping!


Emphasizes a Problem Solving Approach
A first course in combinatorics

Completely revised, How to Count: An Introduction to Combinatorics, Second Edition 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. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics.

New to the Second Edition
This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet’s pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises.

Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya’s counting theorem.


We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an
e-inspection copy

Share this Title