BSc Computer Science and Mathematics / Course details
Year of entry: 2020
Course unit details:
|Unit level||Level 2|
|Teaching period(s)||Semester 2|
|Offered by||Department of Mathematics|
|Available as a free choice unit?||No|
Modern Discrete Mathematics is a broad subject bearing on everything from logic to logistics. Roughly speaking, it is a part of mathematics that touches on those subjects that Calculus and Algebra can't: problems where there is no sensible notion continuity or smoothness and little algebraic structure. The subject, which is typically concerned with finiteor at the most countablesets of objects, abounds with interesting, concrete problems and entertaining examples.
|Unit title||Unit code||Requirement type||Description|
|Foundations of Pure Mathematics A||MATH10101||Pre-Requisite||Compulsory|
|Foundations of Pure Mathematics B||MATH10111||Pre-Requisite||Compulsory|
This module aims to engage students with a circle of concrete problems and applications, algorithmic techniques and basic theorems arising in graph theory.
On completion of this unit successful students will be able to:
- Define what it means for two graphs to be isomorphic and determine, with rigorous supporting arguments, whether two (small) graphs are isomorphic.
- Explain what the chromatic number of a graph is, determine it for small graphs and apply the idea to scheduling problems.
- Say what it means for a graph to be Eulerian and determine whether small graphs or multigraphs are Eulerian.
- Say what it means for a graph to be Hamiltonian and use the Bondy-Chvátal theorem to prove that a graph is Hamiltonian.
- Construct the graph Laplacian and apply the Matrix-Tree Theorem to count the number of spanning trees or spanning arborescences contained in a graph.
- Construct the adjacency matrix of a graph and exploit the connection between powers of the adjacency matrix to count walks. Also, define the operations of tropical arithmetic, construct the weight matrix associated with a weighted graph and use its tropical matrix powers to find the lengths of shortest paths.
- Given a project defined by a set of tasks, along with their durations and prerequisites, use critical path analysis to determine how quickly the project can be completed.
- Say what it means for a graph to be planar; state and apply Kuratowski’s theorem and determine whether a graph is planar or not.
Graph Theory & Applications: 
The basic definitions about graphs should be familiar from the Mathematical Workshop MATH10001, so after a brief review we will treat the following topics:
• Basic notions & notations, trees 
• Eulerian tours & Hamiltonian cycles 
• The Principle of Inclusion/Exclusion and the Matrix-Tree Theorem 
• Shortest paths & applications to scheduling 
Planar graphs & map colouring 
- Coursework; Weighting within unit 20%. This will consist of a problem set due on the last Friday before Easter and handed out two weeks earlier.
- 2 hours end of semester examination; Weighting within unit 80%
Feedback tutorials will provide an opportunity for students' work to be discussed and provide feedback on their understanding. Coursework or in-class tests (where applicable) also provide an opportunity for students to receive feedback. Students can also get feedback on their understanding directly from the lecturer, for example during the lecturer's office hour.
Recommended: Dieter Jungnickel (2013), Graphs, Networks and Algorithms, 4th edition, Springer.
Harris, Hurst & Mossinghoff (2008), Combinatorics and Graph Theory, Springer.
Marcus (2008), Graph Theory: a problem oriented approach, Mathematical Association of America.
Biggs (1993), Algebraic Graph Theory, 2nd edition, CUP.
Cameron (2017), Notes on Counting: An Introduction to Enumerative Combinatorics, CUP.
|Scheduled activity hours|
|Independent study hours|
|Mark Muldoon||Unit coordinator|