MATH 850 - Discrete Mathematics I

Description
Enumeration of standard combinatorial objects (subsets, partitions, permutations). Structure and existence theorems for graphs and sub-graphs. Selected classes of error-correcting codes. Extremal combinatorics of graphs, codes, finite sets and posets. Enrollment Requirements: MATH 310 or 325.
Credits
3
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Fall 2017
Offered
MWF
Avg. Class Size
30
Avg. Sections
1