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

Why is this unit important? Combinatorics is the study of discrete structures, which are ubiquitous in our everyday lives. While combinatorics has important practical applications (for example to ...

Park Jin-young, an assistant professor of mathematics at New York University, has emerged as a leading expert in probabilistic combinatorics, a branch of discrete mathematics, for her groundbreaking ...

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...

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

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...