MATH 510 - Discrete Mathematics

Credits: 3

Combinatorics and graph theory. Topics selected from counting principles, permutations and combinations, the inclusion-exclusion principle, recurrence relations, trees, graph coloring, Eulerian and Hamiltonian circuits, block designs, and Ramsey Theory.

Requisites:
Prerequisite: Sophomore standing and MATH 221.

Typically Offered
Fall, Spring, Summer