- Shopping Bag ( 0 items )
From the Publisher"The main difference between this edition and the first is the addition of ten new sections (six in Chapter 1 and four in Chapter 3)and more than 350 new exercises."
This book is an introduction to enumerative combinatorics for graduate students and researchers. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. The four chapters are devoted to enumeration, sieve methods (including the Principle of Inclusion-Exclusion), partially ordered sets, and rational generating functions. There are a large number of exercises, almost all with solutions, which greatly augment the text and provide entry into many areas not covered directly. The author stresses important connections with other areas of mathematics. This is a reissue of a book first published in 1986. The author has updated the references and included more problems. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.
|Ch. 1||What Is Enumerative Combinatorics?||1|
|Ch. 2||Sieve Methods||64|
|Ch. 3||Partially Ordered Sets||96|
|Ch. 4||Rational Generating Functions||202|
|App||Graph Theory Terminology||293|