Applied Combinatorics

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. Topics include 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 Polya theory; and graph algorithms: minimum weight spanning trees, Dijkstra's algorithm, network flows.