Combinatorics is mathematics of enumeration, existence, construction, and optimization questions concerning finite sets. This text focuses on the first three types of questions and covers basic counting and existence principles, distributions, generating functions, recurrence relations, Pólya theory, combinatorial designs, error correcting codes, partially ordered sets, and selected applications to graph theory including the enumeration of trees, the chromatic polynomial, and introductory Ramsey theory. The only prerequisites are single-variable calculus and familiarity with sets and basic proof techniques. The text emphasizes the brands of thinking that are characteristic of combinatorics: bijective and combinatorial proofs, recursive analysis, and counting problem classification. It is flexible enough to be used for undergraduate courses in combinatorics, second courses in discrete mathematics, introductory graduate courses in applied mathematics programs, as well as for independent study or reading courses.
A hardcover version of this book is available in our regular store.
* As a textbook, Combinatorics does have DRM. Our DRM protected PDFs can be downloaded to three computers. iOS and Android tablets can open secure PDFs using the AWReader app (available in the App Store and the Play Store). The iOS app uses the native iPad PDF reader so it is a very basic reader, no frills. Linux is not supported at this time for our secure PDFs.
|DRM PDF Price|
|Combinatorics: A Guided Tour||$33.00|