Introductory Combinatorics (Classic Version), 5th edition

Published by Pearson (12 May 2023) © 2024

  • Richard A. Brualdi

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.

Online exclusive offer

Introductory Combinatorics (Classic Version)+ subscription to Study & Exam Prep

Introductory Combinatorics (Classic Version)

Access details

  • Instant access once purchased
  • Anytime, anywhere learning with the Pearson+ app

Features

  • Search, highlight and take notes
  • Watch embedded videos with select titles
  • Easily create flashcards
Requires a Course ID, a link from your instructor or an LMS link (Blackboard™, Canvas™, Moodle or D2L®)
Products list

Details

  • A print edition

This product is expected to ship within 3-6 business days for US and 5-10 business days for Canadian customers.

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