Close Menu

MATH 553 - Discrete Applied Mathematics I

Course Description: 

A graduate-level introduction to modern graph theory through existential and algorithmic problems, and the corresponding structural and extremal results from matchings, connectivity, planarity, coloring, Turán-type problems, and Ramsey theory. Proof techniques based on induction, extremal choices, and probabilistic methods will be emphasized with a view towards building an expertise in working in discrete applied mathematics.

Credit: 

(3-0-3)

Prerequisite: 

[(MATH 454 with min. grade of C)]

Corequisite: 

None

Attachments: