# MUIC Math

Mathematics at MUIC

### Site Tools

seminar:cl_well_quasi_ordering

# Differences

This shows you the differences between two versions of the page.

 — seminar:cl_well_quasi_ordering [2017/06/29 16:04] (current)pornrat created 2017/06/29 16:04 pornrat created 2017/06/29 16:04 pornrat created Line 1: Line 1: + << [[:seminar|Seminar]] + ====== Well-Quasi-Ordering by Graph Relations ====== + ~~NOTOC~~ + + **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 ==== + * {{ :seminar:WQO.pdf |Slides}} \\ + * {{ :seminar:chan_wqopic.pdf |Beautiful Pictures}} + + {{tag>seminar}}