|タイトル||Matching extensions in triangulations and near triangulations|
|講演者||Robert E.L. Aldred 氏 (University of Otago)|
|内容||On any surface there are only finitely many graphs that are more than 3-extendable.
In the plane there are no 3-extendable graphs. When the graph we consider is a triangulation of a surface we are able to show that the barriers to matching extension are very local.
In this talk we will look at some of the results obtained in this area and also some directions in which the triangulation hypothesis may be relaxed and some of the results we have been able to obtain in these more general graphs.