MAT250 — Discrete Mathematics
MAT 250 - Discrete Mathematics MAT 250 - Discrete Mathematics Sets, functions, mathematical induction, relations, partially ordered sets, combinatorics including permutations, the pigeonhole principle, binomial and multinomial coefficients, recurrence relations, generating functions, the principle of inclusion-exclusion. Graph theory, including paths and connectedness, minimum length paths, Eulerian and Hamiltonian graphs, graph isomorphisms, trees, planar and nonplanar graphs. Use basic principles of various discrete mathematical structures that are built from set theory. Apply basic theorems and principles of counting and probability to various problems. Apply basic theorems and principles of graph theory to various problems.