Use this URL to cite or link to this record in EThOS:
Title: Graph parameters and the speed of hereditary properties
Author: Collins, Andrew
Awarding Body: University of Warwick
Current Institution: University of Warwick
Date of Award: 2017
Availability of Full Text:
Access from EThOS:
Access from Institution:
In this thesis we study the speed of hereditary properties of graphs and how this defines some of the structure of the properties. We start by characterizing several graph parameters by means of minimal hereditary classes. We then give a global characterization of properties of low speed, before looking at properties with higher speeds starting at the Bell number. We then introduce a new parameter, clique-width, and show that there are an infinite amount of minimal hereditary properties with unbounded clique-width. We then look at the factorial layer in more detail and focus on P7-free bipartite graphs. Finally we discuss word-representable graphs.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA Mathematics