MATH 315 - Applied Combinatorics

Institution:

University of Michigan-Dearborn

Subject:

Mathematics

Description:

An introduction to methods and applications of enumerative and configural combinatorics. Students study several elegant and useful techniques for counting and/or generating the elements in large and unwieldy finite sets. Students will also study topics in graph theory that are applicable to real world problems. Topics include basic counting principles, the principle of inclusion-exclusion, generating functions and recurrence relations. Topics from graph theory include graph models, paths, circuits, cycles, connectedness, planarity, coloring, directed graphs, and networks and network flows. (AY, W).

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.umd.umich.edu/

Phone Number:

(313) 593-5000

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.