arvind@theory.toronto.edu (Arvind Gupta) (02/11/89)
The next talk will be held Monday Feb. 13 in SF3207 at 11:00am (instead of on Tuesday). I have notes from the last 3 talks available so if you need these please come and see me. Arvind Gupta (arvind@theory, SF3213, x4837)
arvind@theory.toronto.edu (Arvind Gupta) (02/20/89)
The next talk is Tuesday February 21, 1989 in SF3207 (Conference Room). This week I will try and prove that Graphs with bounded tree width are well quasi ordered under minors. If you haven't been coming for the past few weeks this is a good time to jump back in since I am now basically finished the stuff on tree decompositions and you can simply believe the basic facts needed. I am (finally) finished the notes from last week. Sorry this took longer than expected. They will be on the top right-hand corner of my desk in a file folder. Notes from previous weeks are also in that folder. Arvind Gupta (arvind@theory, SF3213, x4837)
arvind@theory.toronto.edu (Arvind Gupta) (02/27/89)
The next graph minors talk will be held tomorrow (Feb. 28) at 10am in
SF3207.
Arvind Guptaarvind@theory.toronto.edu (Arvind Gupta) (03/14/89)
The next talk is tomorrow (Tuesday March 14) at 11am in SF3207. I will finally start something relatively new (wqo planar graphs). Arvind
arvind@theory.toronto.edu (Arvind Gupta) (03/20/89)
The next talk will be tomorrow (Tuesday March 21) at 11am in SF3207. I will continue talking about Wagner's Conjecture for planar graphs. Arvind (arvind@theory, SF3213, x4837)
sacook@ai.toronto.edu (Stephen Cook) (04/06/89)
I have a paper by Robertson and Seymour outlining their algorithm for the
disjoint paths problem. This will be the subject of Roberson's talk
next Wed. I'm happy to lend it out.
Steve