Back to search

University of Birmingham

From graph minor theory to 3-dimensions

Abstract

dc:description.abstract

This thesis comprises of three projects from topological combinatorics and structural graph theory. Firstly, we extend Heawood's theorem on the colourability of plane triangulations to triangulations of 3-space by proving that a triangulation of 3-space can be edge coloured with three colours if and only if all edges have even degree. Next, we propose an open question that seeks to generalise the Four Colour Theorem from two to three dimensions and show that 12 instead of four colours are both sufficient and necessary to colour every 2-complex that embeds in a prescribed 3-manifold. However, our example of a 2-complex that requires 12 colours is not simplicial. We give bounds on this colouring number for simplicial 2-complexes. Lastly, we look at graphs that are not 1-tough and consider the set of minimal seperators of these graphs that "witness" the non-toughness of the graph.

Degree

thesis:*
Name dc:type.qualificationname
d_ph
Level dc:type.qualificationlevel
d_ph
Grantor dc:publisher.institution
University of Birmingham
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Nevinson, Emily

Subjects

dc:subject × 1

Rights

Language dc:language.dcterms_iso639_2
eng

Chain of custody

source
Harvested from
University of Birmingham
Base URL
etheses.bham.ac.uk/cgi/oai2
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Nevinson, Emily. From graph minor theory to 3-dimensions. d_ph thesis, University of Birmingham, 2024.