Mitchel T. Keller and William T. Trotter
| Available versions | HTML, PDF, EPUB, Kindle, and low-cost print |
| Source available | PreTeXt source |
| Exercises | About 250 |
| Answers | No |
| Solution Manual | Yes |
| Other ancillaries | Slides with peer instruction questions |
| License | Creative Commons Attribution Share Alike |
- 362 pages (PDF) and 16 chapters for a one semester course
- Print version for about $20 from Amazon
- Course adoption list
- Embedded Sage cells in the HTML version
- For more information and to download PDF or to access HTML
This book was designed for the junior level combinatorics course at Georgia Tech for students in computer science and in applied mathematics. The authors began writing the book in 2004 and has benefited from extensive classroom use. The source is now in MathBook XML, which serves as the common source for all three versions: HTML, PDF, and print, and so they are virtually identical. The HTML version does have the advantage of live Sage cells that the reader can evaluate and modify.
Contents
- An Introduction to Combinatorics
- Strings, Sets, and Binomial Coefficients
- Induction
- Combinatorial Basics
- Graph Theory
- Partially Ordered Sets
- Inclusion-Exclusion
- Generating Functions
- Recurrence Equations
- Probability
- Applying Probability to Combinatorics
- Graph Algorithms
- Network Flows
- Combinatorial Applications of Network Flows
- Pólya’s Enumeration Theorem
- The Many Faces of Combinatorics