Combinatorics and discrete mathematics form a vibrant and expansive branch of modern mathematics, dedicated to the study of finite or countable structures and the methods used to count, classify, and ...

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 ...

In discrete mathematics and combinatorics courses, students learn to master the use and combinations of integers, graphs, sets and logic statements. These are the best graduate schools for discrete ...

This unit serves as an introduction to combinatorics, developing fundamental aspects of a diverse range of topics in discrete mathematics such as enumeration, extremal graph theory, Ramsey theory and ...

Catalan numbers, a distinguished sequence in combinatorial mathematics, consistently emerge in a wide range of counting problems—from enumerating binary trees and Dyck paths to counting possible ...

Dr. Coppenbarger received a BS in Math and Physics at the University of Arizona before going to the University of Rochester to earn a Ph.D. in Mathematics studying quantum mechanics on graphs. He has ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...