Discovery Projects - Grant ID: DP140102747 [ 2014 - 2016 ]

Research Grant

[Cite as]

Researchers Prof Gordon Royle;

Brief description This project will develop the theory of real chromatic roots of graphs, especially as it applies to minor-closed classes of graphs, with the aim of extending this theory to minor-closed classes of matroids. One of the fundamental results from the study of real chromatic roots in graph theory is that any minor-closed class of graphs has an absolute upper bound on its chromatic roots. However, while many results on minor-closed classes on graphs have close analogues or mild variants for minor-closed classes of matroids, this upper bound on real chromatic roots appears, somewhat mysteriously, to apply only to graphs. By studying the upper root-free intervals of minor-closed classes of matroids, this project aims to shed light on this phenomenon.

Funding Amount 351000

Funding Scheme Discovery Projects

Click to explore relationships graph
Viewed: [[ro.stat.viewed]]