Amazon cover image
Image from Amazon.com

Introductory combinatorics Richard A Brualdi

By: Material type: TextTextLanguage: English Series: Always LearningPublication details: Noida : Pearson Education, 2004.Edition: 4th edDescription: x, 630 pages : ill.; 24 cmISBN:
  • 9788131718827
Subject(s): DDC classification:
  • 511.6 BRU
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.
Summary: This, the best selling book in its market, emphasizes 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, and combinatortial structures (matchings, designs, graphs), flows in networks.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
General Books General Books CUTN Central Library Sciences Non-fiction 511.6 BRU (Browse shelf(Opens below)) Available 36667
General Books General Books CUTN Central Library Sciences Non-fiction 511.6 BRU (Browse shelf(Opens below)) Available 36668

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.

This, the best selling book in its market, emphasizes 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, and combinatortial structures (matchings, designs, graphs), flows in networks.

There are no comments on this title.

to post a comment.

Powered by Koha