Sidebar
seminar:cl_well_quasi_ordering
« Seminar
Well-Quasi-Ordering by Graph Relations
Chanun Lewchalermvongs
Mahidol University, Bangkok
16:00 Wednesday, 14 June 2017, Room 3306, MUIC
Abstract
Robertson and Seymour proved Wagner’s Conjecture, which says that finite graphs are well-quasi-ordered by the minor relation. Their work motivates the question as to whether any class of graphs is well-quasi-ordered by other containment relations. We begin with a brief introduction to various graph containment relations and then discuss their connections with well-quasi-ordering.
Resources
Last modified: 2017/06/29 16:04