Use the Tab and Up, Down arrow keys to select menu items.
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.For a full list of Honours courses, please refer to the School of Mathematics and Statistics Honours Booklet Mathematics and Statistics Honours Booklet
This course will provide students with an opportunity to develop the Graduate Attributes specified below:
Subject to approval of the Head of School.
Students must attend one activity from each section.
Mathematics and Statistics Honours Booklet
General information for students
Domestic fee $932.00
International Postgraduate fees
* Fees include New Zealand GST and do not include any programme level discount or additional course related expenses.
For further information see
Mathematics and Statistics.