This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area. Topics to be covered include: Brief ...

Discrete math is one of the oldest branches of mathematics, with a direct line of descent from problems studied in the most ancient mathematical texts. It includes number theory, the study of patterns ...

Annals of Mathematics, SECOND SERIES, Vol. 182, No. 1 (July, 2015), pp. 307-325 (19 pages) We prove that there exist infinite families of regular bipartite Ramanujan graphs of every degree bigger than ...

Simon Špacapan, SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES, Applicable Analysis and Discrete Mathematics, Vol. 15, No. 2 (October 2021), pp.

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