Introductory Combinatorics (Classic Version), 5th edition

Published by Pearson (May 12, 2023) © 2023

  • Richard A. Brualdi

In this eTextbook — More ways to learn

  • More flexible. Start learning right away, on any device.
  • More supportive. Get AI explanations and practice questions (select titles).
  • More interactive. Bring learning to life with audio, videos, and diagrams.
  • More memorable. Make concepts stick with highlights, search, notes, and flashcards.
  • More understandable. Translate text into 100+ languages with one tap.

In this eTextbook — More ways to learn

  • More flexible. Start learning right away, on any device.
  • More supportive. Get AI explanations and practice questions (select titles).
  • More interactive. Bring learning to life with audio, videos, and diagrams.
  • More memorable. Make concepts stick with highlights, search, notes, and flashcards.
  • More understandable. Translate text into 100+ languages with one tap.

In this eTextbook — More ways to learn

  • More flexible. Start learning right away, on any device.
  • More supportive. Get AI explanations and practice questions (select titles).
  • More interactive. Bring learning to life with audio, videos, and diagrams.
  • More memorable. Make concepts stick with highlights, search, notes, and flashcards.
  • More understandable. Translate text into 100+ languages with one tap.

Title overview

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.

Table of contents

  • 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

Need help?Get in touch