This is a text with more than enough material for a one-semester introduction to combinatorics. The original target audience was primarily computer science majors, but the topics included make it suitable for a variety of different students.
- Basic enumeration: strings, sets, binomial coefficients
- Recursion and mathematical induction
- Graph theory
- Partially ordered sets
- Additional enumeration techniques: inclusion-exclusion, generating functions, recurrence relations, and Pólya theory
- Graph algorithms: minimum weight spanning trees, Dijkstra's algorithm, network flows
Mitchel T. Keller