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

Our courses that offer this unit of study

Further unit of study information


Three 1 hour lectures, one 1 hour tutorial and one 1 hour practice class per week.


One 2 hour exam, assignments, quizzes (100%)

Faculty/department permission required?


Unit of study rules


6 credit points of Junior Mathematics units


MATH2011 or MATH2009 or MATH2969

Study this unit outside a degree

Non-award/non-degree study

If you wish to undertake one or more units of study (subjects) for your own interest but not towards a degree, you may enrol in single units as a non-award student.

Cross-institutional study

If you are from another Australian tertiary institution you may be permitted to underake cross-institutional study in one or more units of study at the University of Sydney.