Introductory Combinatorics (3rd ed)

Appropriate for an undergraduate mathematics course on Combinatorics.

This book 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). *NEW-Includes new material on partially ordered sets and Dilworths Theorem. *NEW-Presents new material on partitions of integers and generating functions. *NEW-Chapters on graph theory have been completely revised with a new chapter on digraphs and networks. *Includes new material on partially ordered sets and Dilworth's Theorem *Presents new material on partitions of integers and generating functions *Chapers on graph theory have been completely revised with a new chapter on digraphs and networks *Presents an excellent treatment of Polya's Counting Theorem that doesn't assume the student is familiar with group theory