Use the Tab and Up, Down arrow keys to select menu items.
Matroids (combinatorial geometries) are precisely the geometric structures that underlie the solution of many combinatorial optimisation problems. These problems include scheduling and timetabling, and finding the minimum cost of a communications network between cities. Given this, it is surprising that matroid theory also unifies the notions of linear independence in linear algebra and forests in graph theory as well as the notions of duality for graphs and codes. This course is an introduction to matroid theory and is designed for mathematics and computer science students.Topics:Definition and three fundamental examples; circuits, bases, and uniform matroids; the Greedy Algorithm; geometric representations; the rank function; matroid representation; the closure operator; duality; minors; excluded-minor theorems; the Tutte polynomial.
Subject to approval of the Head of School.
Students must attend one activity from each section.
School of Mathematics and Statistics Postgraduate Handbook
General information for students
Domestic fee $1,000.00
International Postgraduate fees
* All fees are inclusive of NZ GST or any equivalent overseas tax, and do not include any programme level discount or additional course-related expenses.
For further information see
Mathematics and Statistics