Now in a new second edition, this volume presents a clear and concise treatment of an increasingly important branch of mathematics. A unique introductory survey complete with easy-to-understand examples and sample problems, this text includes information on such basic combinatorial tools as recurrence relations, generating functions, incidence matrices, and the non-exclusion principle. It also provides a study of block designs, Steiner triple systems, and expanded coverage of the marriage theorem, as well as a unified account of three important constructions which are significant in coding theory.
1. Introduction to Basic Ideas 2. Selections and Binomial Coefficients 3. Pairings Problems 4. Recurrence 5. The Inclusion-Exclusion Principle 6. Block Designs and Error-Correcting Codes 7. Steiner Systems, Sphere Packings, and the Golay Code
![A First Course in Combinatorial Mathematics [Paperback]](/itemImage/2/7/9/9/2_740406.jpg)