Undergraduate Course: Combinatorics and Graph Theory (MATH10072)
|School||School of Mathematics
||College||College of Science and Engineering
|Credit level (Normal year taken)||SCQF Level 10 (Year 3 Undergraduate)
||Availability||Available to all students
|Summary||A first course in combinatorics and graph theory: Graphs, Euler's V-E+F=2 Theorem, Kuratowski's Theorem, Counting sets, Generating functions, Matching, Hall's Marriage Theorem, Polya counting, Counting paths in graphs.
Graphs (including bipartite, Euler, Hamiltonian, Planar, trees) , Euler's V-E+F=2 Theorem, subdivisions, Kuratowski's Theorem.
Counting sets, subsets, multisets, inclusion/exclusion, applications.
Stirling numbers of first and second kinds, Bell numbers, partitions.
Generating functions, binomial identities.
Matching, Hall's Marriage Theorem, assignment problems.
Counting paths in graphs, adjacency matrix.
Information for Visiting Students
|Pre-requisites||Equivalence relations, permutations, set theory, group theory, binomial coefficients. Visiting students are advised to check that they have studied the material covered in the syllabus of each prerequisite course before enrolling.
|High Demand Course?
Course Delivery Information
|Not being delivered|
On completion of this course, the student will be able to:
- Solve counting problems.
- Identify properties of graphs (such as Eulerian/Hamiltonian/Planar/Bipartite/Connectedness).
- Solve matching problems using Hall's marriage theorem and equivalent bipartite graph formulations.
- Solve counting problems associated to graphs (such as numbers of paths)
|Reference books which contain some material relevant to the course:|
* A First Course in Combinatorial Mathematics by Ian Anderson
* Aspects of Combinatorics by Victor Bryant.
* Graphs An Introductory Approach, by R J Wilson and J J Watkins
* Introduction to Graph Theory, by R J Wilson
|Graduate Attributes and Skills
|Course organiser||Dr Harry Braden
Tel: (0131 6)50 5072
|Course secretary||Mr Christopher Palmer
Tel: (0131 6)50 5060