MATH429-14S1 (C) Semester One 2014

Combinatorics

15 points

Details:
Start Date: Monday, 24 February 2014
End Date: Sunday, 29 June 2014
Withdrawal Dates
Last Day to withdraw from this course:
  • Without financial penalty (full fee refund): Friday, 7 March 2014
  • Without academic penalty (including no fee refund): Friday, 23 May 2014

Description

Combinatorics

Matroids (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 course is an introduction to matroid theory.


For a full list of 2014 Honours courses, please refer to the Department of Mathematics and Statistics Honours Booklet Mathematics and Statistics Honours Booklet

Prerequisites

Subject to approval of the Head of School.

Course Coordinator

Charles Semple

Assessment

Assessment Due Date Percentage 
Internal Assessment 40%
Final Examination 60%

Indicative Fees

Domestic fee $853.00

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

All MATH429 Occurrences

  • MATH429-14S1 (C) Semester One 2014
Previous year Next year