Browsing School of Mathematics by Type "Presentation"
Now showing items 1-3 of 3
(Georgia Institute of Technology, 2012-05)For a minor-closed class of matroids, we consider the maximum number, h(n), of elements in a simple rank-n matroid in the class. This growth-rate function, when finite, is known to be either linear, quadratic, or exponential. ...
(Georgia Institute of Technology, 2012-05)A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the same sequence of colours as the second half. This talk will present some results on nonrepetitive colourings of planar graphs ...
(Georgia Institute of Technology, 2012-05)The defining question is when is a topologically closed class of finite graphs a well-quasi-order (for short wqo).