Graph Minors

Article View: ut.theory

Article #315

#315

From: Arvind Gupta
Date: Mon, 20 Feb 1989 13:58

12 lines
1023 bytes

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)

Technical Details

Message-ID: <89Feb20.085810est.38075@neat.ai.toronto.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.ai.toronto.edu!root

Show Full Headers

Complete Article Headers

Newsgroups: ut.theory
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.ai.toronto.edu!root
From: arvind@theory.toronto.edu (Arvind Gupta)
Subject: Graph Minors
Message-ID: <89Feb20.085810est.38075@neat.ai.toronto.edu>
Organization: Department of Computer Science, University of Toronto
Date: Mon, 20 Feb 89 08:58:08 EST
X-Mailer: Mail User's Shell (6.3 6/25/88)