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
Pr.: Sophomore standing and MATH 221.

When Offered
I, II, S

Print-Friendly Page

Add to Catalog Portfolio.

Close Window