• Title: Applied Combinatorics
• Author(s) Mitchel T. Keller, William T. Trotter
• Publisher: CreateSpace (2017); eBook (Creative Commons Licensed, 2017)
• License(s): CC BY-SA 4.0
• Paperback: 392 pages
• eBook: HTML and PDF (393 pages)
• Language: English
• ISBN-10: 1534878653
• ISBN-13: 978-1534878655
• Share This:  

Book Description

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/.

• Mitchel T. Keller is an Assistant Professor of Mathematics at Washington and Lee University in Lexington, Virginia.
• William T. Trotter is a Professor of Mathematics at the Georgia Institute of Technology in Atlanta.

• Amazon

• Combinatorics and Game Theory
• Graph Theory
• Discrete and Finite Mathematics
• Algebra and Abstract Algebra
• Algorithms and Data Structures

• Applied Combinatorics ( Mitchel T. Keller, et al.)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - 2015 Edtion - PDF
• Book Homepage (Kindle and Apple Edtion, etc.)

• Analytic Combinatorics (Philippe Flajolet and Robert Sedgewick)
• Combinatorics Through Guided Discovery (Kenneth P. Bogart)
• Foundations of Combinatorics with Applications (Edward Bender)