Introductory combinatorics. 2nd ed.

*(English)*Zbl 0734.05001
New York etc.: North-Holland. xiii, 618 p. $ 39.95; Dfl. 120.00 (1992).

Fourteen years after the publication of the first edition (1977; Zbl 0385.05001), this second edition of a book that has been used in many classrooms has received a thorough updating. There have been a few topics inserted while others have been given a different presentation or grouping. Each chapter has been updated thoroughly so that it reflects the present state of knowledge. This new edition is again very well suited for use as a text in undergraduate courses in combinatorics. And although it has increased in size, the 500 or so exercises with their solutions included again make up for a major reason to have this book in the shelf. For an overview, here are the chapter headings: (1) What is combinatorics?; (2) The pigeonhole principle; (3) Permutations and combinatorics; (4) Generating permutations and combinations; (5) The binomial coefficient; (6) The inclusion-exclusion principle; (7) Recurrence relations and generating functions; (8) Special counting sequences; (9) Matchings and bipartite graphs; (10) Combinatorial designs; (11) Introduction to graph theory; (12) More on graph theory; (13) Pólya counting; (14) Solutions and hints (to the exercises of the preceding chapters). The one page bibliography has been updated.

Reviewer: H.-W.Kröger (Berlin)