MTU Library Catalogue

Syndetics cover image
Image from Syndetics

Introductory combinatorics / Richard A. Brualdi.

By: Bsualdi, Richard A.
Material type: materialTypeLabelBookPublisher: Upper Saddle River, NJ : Prentice-Hall, 1997Edition: 3rd ed.Description: x, 614 p. ; 24 cm. + hbk.ISBN: 0131814885.Subject(s): Combinatorial analysisDDC classification: 511.6
Contents:
What is combinatorics? -- The pigeonhole principle -- Permutations and combinations -- Generating permutations and combinations -- The binomial coefficients -- The inclusion-exclusion principle and applications -- Recurrence relations and generating functions -- Special counting sequences -- Matchings in Bipartite graphs -- Combinatorial designs -- Introduction to graph theory -- Digraphs and networks -- More on graph theory -- Polya counting.
Holdings
Item type Current library Call number Copy number Status Barcode
General lending MTU Bishopstown Library Lending 511.6 (Browse shelf(Opens below)) 1 Available 00069360
Total holds: 0

Enhanced descriptions from Syndetics:

Appropriate for an undergraduate junior/senior level mathematics course on combinatorics.

This book emphasizes combinatorial ideas including the pigeon-hole principle, counting techniques, permutations and combinations, P#65533;lya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs).

Previous ed.: 1992.

Bibliography: (pages 607-608) and index.

What is combinatorics? -- The pigeonhole principle -- Permutations and combinations -- Generating permutations and combinations -- The binomial coefficients -- The inclusion-exclusion principle and applications -- Recurrence relations and generating functions -- Special counting sequences -- Matchings in Bipartite graphs -- Combinatorial designs -- Introduction to graph theory -- Digraphs and networks -- More on graph theory -- Polya counting.

Table of contents provided by Syndetics

  • 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 Matchings in Bipartite Graphs
  • 10 Combinatorial Designs
  • 11 Introduction to Graph Theory
  • 12 Digraphs and Networks
  • 13 More on Graph Theory
  • 14 Polya Counting
  • Answers and Hints to Exercises
  • Bibliography
  • Index