MATH 3331 - Combinatorics

Prerequisite: MATH 3311 or consent of the department. Problem solving using graph theory and combinatorical methods. Topics include counting methods, recurrence, generating functions, enumeration, graphs, trees, coloring problems, network flows and matchings. Special emphasis on reasoning which underlies combinatorical problem solving, algorithm development and logical structure of programs. 3 credits.