MATH 350
Download as PDF
Combinatorics & Graph Theory
Mathematics
College of Computational, Mathematical, & Physical Sciences
Course Description
A proof-based introduction to discrete mathematics, including substantial treatment of both enumerative combinatorics and graph theory. Activities include writing and reading proofs, considering examples and counterexamples, and categorizing discrete mathematical structures.
When Taught
Contact Department
Fixed/Max
3
Fixed
3
Title
Prove
Learning Outcome
Students will be able to prove central results from discrete mathematics, as well as other results with similar derivations.
Title
Distinguish
Learning Outcome
Students will be able to distinguish between true and plausibly-sounding false propositions in the language of discrete mathematics.
Title
Construct
Learning Outcome
Students will be able to construct examples and counterexamples illustrating relations between different concepts from discrete mathematics.
Title
Categorize
Learning Outcome
Students will be able to categorize discrete mathematical structures according to their properties.
