Review by Choice Review
Erickson has prepared an exemplary introductory work. The book's three parts ("Existence," "Enumeration," "Construction") show how combinatorics is really three quite different subjects; meanwhile, the elegant recurrence of proof techniques throughout the book (notably the pigeonhole principle and inclusion-exclusion) provides unity. The excitement of recent developments in combinatorics (propelled by the development of computers) is clearly conveyed to the reader, e.g., by the inclusion of selected unsolved problems. The flow of ideas throughout is masterful; each part begins with a simple but elegant "gem" and builds to an exciting "big" result requiring all the machinery developed in that part. The exercise sets also have many good features, particularly the inclusion of problems from the Putnam Competitions. Most instructors, however, will want more elementary problems for their students than are provided here; this brings up the only negative aspect of this book: it will be accessible only to quite mature undergraduates. Graduate students, however, will find this whole book a gem. Strongly recommended for inclusion in undergraduate-level library collections. M. Henle Oberlin College
Copyright American Library Association, used with permission.
Review by Choice Review
