This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...

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

Recent advances in the study of automorphism groups within graph theory have yielded significant theoretical and applied insights. At its core, the interplay between the algebraic structure of groups ...

The so-called differential equation method in probabilistic combinatorics presented by Patrick Bennett, Ph.D., Department of Mathematics, Western Michigan University Abstract: Differential equations ...

Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...

National Institute of Technology (NIT) Andhra Pradesh assistant professor Karthick Seshadri has authored a book on ‘Discrete Mathematics with Applications.’ It is a key prerequisite for emerging ...

3 Apply the principles of set theory, functions and relations. 4 Apply the principles of abstract algebra. 5 Apply techniques of number theory to coding and cryptography. 6 Apply techniques of graph ...