MATH429-12S1 (C) Semester One 2012


0.1250 EFTS
20 Feb 2012 - 24 Jun 2012



Matroids (also called combinatorial geometries) are precisely the structures that underlie the solution of many combinatorial optimization problems.  These problems include scheduling and timetabling, and finding the minimum cost of a communications network between cities. Given this, it is perhaps surprising that matroid theory 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 self-contained course is an introduction to matroid theory, a branch of discrete mathematics that has basic connections with graphs, codes, projective geometries, and combinatorial optimisation. The course is intended for students majoring in Mathematics or Computer Science.

Learning Outcomes

University Graduate Attributes

This course will provide students with an opportunity to develop the Graduate Attributes specified below:

Critically competent in a core academic discipline of their award

Students know and can critically evaluate and, where applicable, apply this knowledge to topics/issues within their majoring subject.


Subject to approval of the Head of School.

Streams Day Time Where Notes
Stream 01 Wednesday 12:00pm-1:00pm Erskine 241 20 Feb - 1 Apr,
30 Apr - 3 Jun
Wednesday 4:00pm-5:00pm Erskine 241 20 Feb - 1 Apr,
30 Apr - 3 Jun

Course Coordinator

Charles Semple

Indicative Fees

Domestic fee $788.00

* 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.

All MATH429 Occurrences