Combinatorics & Graph Theory
Mathematics College of Physical and Mathematical Sciences
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.
Students will be able to prove central results from discrete mathematics, as well as other results with similar derivations.
Students will be able to distinguish between true and plausibly-sounding false propositions in the language of discrete mathematics.
Students will be able to construct examples and counterexamples illustrating relations between different concepts from discrete mathematics.
Students will be able to categorize discrete mathematical structures according to their properties.