Applied Combinatorics

By Mitchel T. Keller and William T. Trotter

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. Graph algorithms: minimum weight spanning trees, Dijkstra's algorithm, network flows

This text is open source and available under a Creative Commons license. To access the free HTML and PDF versions of the text, visit http: //rellek.net/appcomb/.

• Format: Paperback
• Language: English
• ISBN: 1973702711
• ISBN13: 9781973702719
• Release Date: August 2017
• Publisher: Createspace Independent Publishing Platform
• Length: 392 Pages
• Weight: 1.80 lbs.
• Dimensions: 0.8" x 7.4" x 9.7"