Active student engagement is key to this classroom-tested combinatorics
text, boasting 1200+ carefully designed problems, ten mini-projects,
section warm-up problems, and chapter opening problems. The author - an
award-winning teacher - writes in a conversational style, keeping the
reader in mind on every page. Students will stay motivated through
glimpses into current research trends and open problems as well as the
history and global origins of the subject. All essential topics are
covered, including Ramsey theory, enumerative combinatorics including
Stirling numbers, partitions of integers, the inclusion-exclusion
principle, generating functions, introductory graph theory, and
partially ordered sets. Some significant results are presented as sets
of guided problems, leading readers to discover them on their own. More
than 140 problems have complete solutions and over 250 have hints in the
back, making this book ideal for self-study. Ideal for a one semester
upper undergraduate course, prerequisites include the calculus sequence
and familiarity with proofs.