Introductory combinatorics
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
![]() |
Stack | Stack | 511.6 BRU/I (Browse shelf (Opens below)) | Available | 59478 |
Browsing Kannur University Central Library shelves, Shelving location: Stack, Collection: Stack Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
511.5 WIL/I Introduction to graph theory / | 511.502855369 TRO/M The Mathematica guidebook for graphics | 511.6 BRU/I Introductory combinatorics | 511.6 BRU/I Introductory combinatorics | 511.6 LIN/C Course in combinatorics | 511.62 BEN/P Proofs that really count : the art of combinatorial proof | 511.7028542 MIS/C computer oriented numerical and statistical methods |
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 on this title.