Mechanised Graph Theory

Keywords: Interactive Theorem Proving, Proof Mechanisation, Higher Order Logic, Graph Theory
Units: 12/24 units


Mechanising mathematics is the task of turning (relatively) well-understood mathematics into verified proofs with an interactive theorem-proving system. Such verified material can then lie behind high-assurance software.

This project is an opportunity for students who wants to learn the HOL4 theorem-proving system and realise an important piece of mathematics. At thesis level (24 units), the simple mechanisation of the mathematics would need to be augmented with an application of the mechanisation and/or significant novelty in the nature of the proofs.

Research Questions and Tasks

The aim of this research project is to mechanize the beginning part of Graphy Theory in the HOL theorem prover (HOL4), following [Diestel] (or [Diestel4]). The basic definitions of (simple) graphs are already there. This will include the following tasks:

  • Mechanize all major theorems of Chapter 2 (Matching, Covering and Packing) of [Diestel].
  • (for 24 credits) Mechanize all major theorems of Chapter 3 (Connectivity) of [Diestel].

The development should follow modern techniques and guidelines for HOL4, e.g. [HOLTutorial] and [HOL4]. Ideally, the project will be submitted to HOL4 official as part of its core theories.

NOTE: The student will get some basic training through a mini course to get familar with interactive theorem proving (ITP) techniques (and HOL4 in particular).



Basic knowledge of formal logic and lambda-calculus (simple typed); some experiences with interactive theorem provers; mathematics (discrete mathematics and graph theory basics)

You are on Aboriginal land.

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

arrow-left bars search times