Introductory Combinatorics
3rd Edition
Published on 8. January 1999
Book
Hardback
614 pages
978-0-13-181488-2 (ISBN)
Description
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, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs).
This book emphasizes combinatorial ideas including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs).
More details
Edition
3rd edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 30 mm
Weight
860 gr
ISBN-13
978-0-13-181488-2 (9780131814882)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Richard A. Brualdi
Introductory Combinatorics
Book
05/2004
4th Edition
Pearson
€84.17
Article exhausted; check for reprint
Previous edition
Richard A. Brualdi
Introductory Combinatorics
Book
03/1992
2nd Edition
Elsevier
€30.95
Article exhausted; check for reprint
Content
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.
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.