KCST Library

Your cart is empty.



KCST LIBRARY MANAGEMENT PORTAL

Normal view MARC view ISBD view

Introductory combinatorics / Richard A. Brualdi.

By: Brualdi, Richard A.
Material type: TextTextPublisher: Upper Saddle River, N.J. : Pearson/Prentice Hall, c2010Edition: 5th ed.Description: xii, 605 p. : ill. ; 24 cm.ISBN: 9780136020400 (hbk. : alk. paper).Subject(s): Combinatorial analysis -- Textbooks | Computer science -- MathematicsDDC classification: 511.6 Online resources: Table of contents only
Incomplete 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.
Summary: Introductory Combinatorics 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). Written to be entertaining and readable, this book's lively style reflects the author's joy for teaching the subject. It presents an excellent treatment of Polya's Counting Theorem that doesn't assume the student is familiar with group theory. It also includes problems that offer good practice of the principles it presents. The third edition of Introductory Combinatorics has been updated to include new material on partially ordered sets, Dilworth's Theorem, partitions of integers and generating functions. In addition, the chapters on graph theory have been completely revised. A valuable book for any reader interested in learning more about combinatorics.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Home library Call number Status Date due Barcode Item holds
Book Book KCST Library
511.6 Br In (Browse shelf) Available 1000000269
Total holds: 0

Includes bibliographical references (p. 596-597) and index.

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.

Introductory Combinatorics 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). Written to be entertaining and readable, this book's lively style reflects the author's joy for teaching the subject. It presents an excellent treatment of Polya's Counting Theorem that doesn't assume the student is familiar with group theory. It also includes problems that offer good practice of the principles it presents. The third edition of Introductory Combinatorics has been updated to include new material on partially ordered sets, Dilworth's Theorem, partitions of integers and generating functions. In addition, the chapters on graph theory have been completely revised. A valuable book for any reader interested in learning more about combinatorics.

There are no comments for this item.

Log in to your account to post a comment.








© KCST LIBRARY 2019
//