• Find courses by code
    Year
  • Find courses by subject

MATH429-12S1 (C) Semester One 2012
Combinatorics

0.1250 EFTS
20 Feb 2012 - 24 Jun 2012
↓Other occurrences

Description

Combinatorics

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.

Pre-requisites

Subject to approval of the Head of Department.
Lectures
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

Fees

Domestic fee $788.00
International fee $3,588.00


For further information see Mathematics and Statistics.

All MATH429 Occurrences

Previous Year          Next Year