Use the Tab and Up, Down arrow keys to select menu items.
This course is an introduction to matroid theory, a subject that 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. Matroids are also the geometric structures that underlie the solution of many combinatorial optimisation problems.
Subject to approval of the Head of School.
Students must attend one activity from each section.
There are no tutorials. However, please feel free to see me in my office at any time.
There are six fortnightly assignments. The final examination is 150 minutes and worth 60%.To obtain a passing grade in this course you must pass the course as a whole (which requires an overall mark of 50% or more) and score at least 40% in the final exam.
There is no set text for the course. However, an excellent text is Matroid Theory by James Oxley. There are two copies (1st and 2nd Editions) in the Engineering and Physical Sciences Library.In addition, there are several other texts on matroid theory that can be found in the library. You are encouraged to read from these and other sources
Domestic fee $1,074.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