Discrete Mathematics is a subject that has gained prominence in recent times. Unlike regular Maths, where we deal with real numbers that vary continuously, Discrete Mathematics deals with logic that ...

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

Extremal graph theory seeks the largest or smallest structure a graph can exhibit under given constraints, typically by forbidding a particular subgraph. The classical Turán problem determines the ...

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