MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02218nam a22002657a 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
15433993 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
IIITD |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250430020003.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
080829s2010 njua b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9789353433062 |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(OCoLC)ocn245024866 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
IIITD |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.6 |
| Item number |
BRU-I |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Brualdi, Richard A. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Introductory combinatorics |
| Statement of responsibility, etc |
by Richard A. Brualdi |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
5th ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Noida : |
| Name of publisher, distributor, etc |
Pearson, |
| Date of publication, distribution, etc |
©2019 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xi, 605 p. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 505 1# - FORMATTED CONTENTS NOTE |
|---|
| Title |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Combinatorial analysis |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science- Mathematics |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Books |
| Koha issues (borrowed), all copies |
1 |
