Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

Combinatorial structures such as set systems, hypergraphs and families of finite objects form a unifying framework for extremal problems that probe how local intersection constraints govern global ...

Combinatorial structures encompass an array of discrete objects—permutations, set partitions, matchings, trees and lattice paths—whose enumeration and intrinsic properties are often captured by ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.