3 Review(s)

This trusted best-seller covers the key combinatorial ideasincluding the pigeon-hole principle, counting techniques, permutations and combinations, counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatorial structures (matchings, designs, graphs), and flows in networks. The 5th Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises.Features:1) Covers a wide range of topics:-Dilworth's Theorem-Partitions of integers-Counting sequences and generating functions-Extensive graph theory coverage2) A clear and accessible presentation, written from the student's perspective, facilitates understanding of basic concepts and principles.3) An excellent treatment of s Counting Theorem that does not assume students have studied group theory.4) Many worked examples illustrate methods used.Table of Contents:Chapter 1. What is Combinatorics?Chapter 2. The Pigeonhole PrincipleChapter 3. Permutations and CombinationsChapter 4. Generating Permutations and CombinationsChapter 5. The Binomial CoefficientsChapter 6. The Inclusion-Exclusion Principle and ApplicationsChapter 7. Recurrence Relations and Generating FunctionsChapter 8. Special Counting SequencesChapter 9. Systems of Distinct RepresentativesChapter 10. Combinatorial DesignsChapter 11. Introduction to Graph TheoryChapter 12. More on Graph Theory Chapter 13. Digraphs and NetworksChapter 14. Counting