|
Apr 17, 2024
|
|
|
|
MATH 471 - Combinatorics (3) Analyze discrete structures, including existence, enumeration, and optimization. Permutations and combinations, combinatorial identities, the inclusion-exclusion principle, recurrence relations, Polya counting. Basic definitions and properties of graphs, Eulerian and Hamiltonian graphs, trees, graph colorings and chromatic number, planar graphs.
Prerequisite: MATH 302 or MATH 307 .
Add to Portfolio (opens a new window)
|
|