Use the Tab and Up, Down arrow keys to select menu items.
Combinatorics
Matroids (combinatorial geometries) are precisely the 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. 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.
Subject to approval of the Head of School.
Charles Semple
School of Mathematics and Statistics Postgraduate Handbook General information for students Library portal
Domestic fee $950.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 .