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

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

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

Extremal graph theory seeks to determine the maximum or minimum values of graph invariants—such as edge count, degree sequence or subgraph density—subject to the exclusion of particular configurations ...

The zeta function of a graph, inspired by analogues in number theory and differential geometry, encodes fundamental cycle and path data in a compact analytic form. Its prototypical instance, the Ihara ...

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