A Gentle Introduction to Discrete Mathematics
A textbook for a junior or senior level course in Discrete Mathematics.
- Enumerative combinatorics a) multiplication and addition principles b) permutations c) combinations d) recursion e) generating functions
- Graph Theory a) complete, bipartite, multipartite, trees/forests b) Hamiltonian and Eulerian circuits (paths) c) coloring d) pebbling e) minimal spanning trees f) travelling salesman problem g) max flow min cut
- Discrete Geometry a) finite fields b) affine geometries c) projective geometries d) error-correcting codes e) combinatorial designs