MATH-4350 Discrete Mathematics
The topics covered in the course include: the fundamental techniques of counting, combinatorics, and discrete probability; permutations, combinations, the Principle of Inclusion/Exclusion, the Pigeonhole Principle, the Binomial Theorem; inductive and recursive definitions and arguments, recurrence relations; graph theory, bipartite graphs, paths, cycles, circuits, networks, digraphs, trees, Eulerian and Hamiltonian graphs, degree conditions, connectivity, forbidden subgraphs, and modeling. Numerical techniques used in modeling the behavior of a discrete variable will be employed to research a number of mathematical models used in approximating diverse discrete structures. Topics will be explored using various optimization tools.