-
Institution:
-
University of Michigan-Ann Arbor
-
Subject:
-
-
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, networks and network flows. 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Mathematics Department Course Attributes: Upper Division
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(734) 764-1817
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Trimester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.