Introductory Combinatorics (Classic Version), 5th edition

  • Richard A. Brualdi

$9.99per month

6 monthly payments or pay $59.94 one-time

eTextbook

ISBN-13: 9780137981045 (2023 update)

Purchasing Instructions

This form contains two groups of radio buttons, one for Exam Pack purchasing options, and one for standard purchasing options. Only one option can be chosen for purchase. Any option that is selected will deselect any previously selected purchase option.

eTextbook + Study Prep

ISBN-13: 9780137981045 (2023 update)

  • Find it fast

    Quickly navigate your eTextbook with search

  • Stay organized

    Access all your eTextbooks in one place

  • Easily continue access

    Keep learning with auto-renew

Introductory Combinatorics covers the key combinatorial ideas including the pigeon-hole principle, counting techniques, permutations and combinations, Pólya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial 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.

This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price.

Published by Pearson (May 12th 2023) - Copyright © 2024

ISBN-13: 9780137981045

Subject: Advanced Math

Category: Combinatorics

  • 1. What is Combinatorics?
  • 2. The Pigeonhole Principle
  • 3. Permutations and Combinations
  • 4. Generating Permutations and Combinations
  • 5. The Binomial Coefficients
  • 6. The Inclusion-Exclusion Principle and Applications
  • 7. Recurrence Relations and Generating Functions
  • 8. Special Counting Sequences
  • 9. Systems of Distinct Representatives
  • 10. Combinatorial Designs
  • 11. Introduction to Graph Theory
  • 12. More on Graph Theory
  • 13. Digraphs and Networks
  • 14. Pólya Counting