seminar:cl_excluded_minor

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

— |
seminar:cl_excluded_minor [2017/03/13 09:07] (current) pornrat created |
||
---|---|---|---|

Line 1: | Line 1: | ||

+ | << [[: | ||

+ | ====== Excluded Minor Theorems for Graphs ====== | ||

+ | ~~NOTOC~~ | ||

+ | |||

+ | **Chanun Lewchalermvongs** \\ | ||

+ | Department of Mathematics, | ||

+ | |||

+ | 16:00 Wednesday 15 March 2017, Room 3303, MUIC | ||

+ | |||

+ | |||

+ | ==== Abstract ==== | ||

+ | |||

+ | A graph $H$ is a //minor// of a graph $G$ if $H$ is obtained from $G$ by a (possibly empty) sequence of vertex deletions, edge deletions, and edge contractions (where the order of the graph operations is irrelevant). Then $G$ is called $H$-// | ||

+ | |||

+ | In this area, the two most famous open problems are to determine $K_6$-free and Petersen-free graphs. To solve problems involving $H$-free graphs, it is often desirable to explicitly determine all $H$-free graphs. An excluded minor theorem describes the structure of $H$-free graphs. We discuss excluded minor theorems for small graphs. | ||

+ | |||

+ | |||

+ | |||

+ | |||

+ | {{tag> |

Last modified: 2017/03/13 09:07