Prof Gregory Sorkin

This course is available on the BSc in Data Science, BSc in Mathematics and Economics, BSc in Mathematics with Data Science, BSc in Mathematics with Economics and BSc in Mathematics, Statistics and Business. This course is available as an outside option to students on other programmes where regulations permit. This course is available with permission to General Course students.

MA103 Introduction to Abstract Mathematics, or an equivalent course giving a background in rigorous mathematics.

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph Theory: basic concepts; walks, paths, tours and cycles; trees and forests; colourings. Coding theory: basic concepts; linear codes.

This course is delivered through a combination of classes and lectures totalling a minimum of 30 hours across Winter Term.

Written answers to set problems will be expected on a weekly basis.

PJ Cameron, Combinatorics (CUP 1994)

An alternative book is: NL Biggs, Discrete Mathematics (OUP 2004)

Extensive notes covering the course content in full will be distributed, so you may well not need either book.

Exam (90%, duration: 2 hours) in the spring exam period.
Continuous assessment (10%).