You are here: Home / Future students / Course search

Discrete Mathematics and Graph Theory

MATH2069

This unit introduces students to several related areas of discrete mathematics, which serve their interests for further study in pure and applied mathematics, computer science and engineering. Topics to be covered in the first part of the unit include recursion and induction, generating functions and recurrences, combinatorics, asymptotics and analysis of algorithms. Topics covered in the second part of the unit include Eulerian and Hamiltonian graphs, the theory of trees (used in the study of data structures), planar graphs, the study of chromatic polynomials (important in scheduling problems), maximal flows in networks, matching theory.

Unit of study details

Unit of study level: Intermediate

Credit points: 6

Commencing semesters: 1

Further unit of study information

Unit of study handbook: MATH2069

Costs and scholarships information: Costs and Scholarships

Final dates to withdraw from units of study: Census Dates

Available for study abroad and exchange: Yes

Our courses that offer this unit of study