The current edition is about 60% longer and represents an extensively updated collaboration coauthored with R.B.J.T. Allenby. Both authors have decades of experience teaching related material at the University of Leeds. The book is beautifully structured to facilitate both instruction in a classroom as well as self-instruction. Every section of the book has a number of [paired] exercises which are designed to solidify and build understanding of the topics in the section.

This is exactly the kind of exercise regimen serious readers, instructors, and students need and are so rarely provided. Another pedagogical asset of the text is the extensive incorporation of historical anecdotes about the discoverers of the results. it fosters an admiration of the developers of the field, an attitude which is key to transforming students of mathematics into professional mathematicians. The authors have created an interesting, instructive, and remarkably usable text. The book clearly benefits instructors who need a solid, readable text for a course on discrete mathematics and counting. In fact, for any professional who wants an understandable text from which they can acquire a broad and mathematically solid view of many of the classic problems and results in counting theory, including their origin, proof, and application to other problems in combinatorics, this book is recommended. --James A. McHugh, SIAM Review, 54 (1), 2012 .

thoughtfully written, contain[s] plenty of material and exercises . very readable and useful . --MAA Reviews, February 2011 The reasons I adopted this book are simple: it's the best one-volume book on combinatorics for undergraduates. It begins slowly and gently, but does not avoid subtleties or difficulties. It includes the right mixture of topics without bloat, and always with an eye to good mathematical taste and coherence. Enumerative combinatorics is developed rather fully, through Stirling and Catalan numbers, for example, before generating functions are introduced. Thus this tool is very much appreciated and its 'naturalness' is easier to comprehend. Likewise, partitions are introduced in the absence of generating functions, and then later generating functions are applied to them: again, a wise pedagogical move.

The ordering of chapters is nicely set up for two different single-semester courses: one that uses more algebra, culminating in Polya's counting theorem; the other concentrating on graph theory, ending with a variety of Ramsey theory topics. I was very much impressed with the first edition when I encountered it in 1994. I like the second edition even more. --Paul Zeitz, University of San Francisco, California, USA Completely revised, the book shows how to solve numerous classic and other interesting combinatorial problems. The reading list at the end of the book gives direction to exploring more complicated counting problems as well as other areas of combinatorics. --Zentralblatt MATH 1197.