MATH 318 - Combinatorics & Graph Theory

Prerequisites/Corequisites: Take MATH-203. (Required, Previous).
Credit Hours: Min: 3; Max:

Description: In combinatorial theory the course will discuss the basic counting principles, arrangements, distributions of objects, combinations, and permutations. Considerable attention will be given to ordinary and exponential generating functions. Also to be covered will be the standard counting techniques of recurrence, inclusion-exclusion, Burnside's Theorem, and Polya's Enumeration Formula. In graph theory the course will cover the basic theory of graphs. Also covered will be graph isomorphism, planar graphs, Euler and Hamiltonian circuits, trees, and graph colorings.

No periods were set for this course