|
UWSpace >
University of Waterloo >
Electronic Theses and Dissertations (UW) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10012/1024
|
| Title: | Packing Directed Joins |
| Authors: | Williams, Aaron |
| Keywords: | Mathematics
directed graph
directed cut
directed join
min-max
Woodall's Conjecture
Edmonds-Giles Conjecture |
| Approved Date: | 2004 |
| Date Submitted: | 2004 |
| Abstract: | Edmonds and Giles conjectured that the maximum number of directed joins in a packing is equal to the minimum weight of a directed cut, for any weighted directed graph. This is a generalization of Woodall's Conjecture (which is still open). Schrijver found the first known counterexample to the Edmonds-Giles Conjecture, while Cornuejols and Guenin found the next two. In this thesis we introduce new counterexamples, and prove that all minimal counterexamples of a certain type have now been found. |
| Department: | Combinatorics and Optimization |
| Degree: | Master of Mathematics |
| URI: | http://hdl.handle.net/10012/1024 |
| Appears in Collections: | Electronic Theses and Dissertations (UW)
Faculty of Mathematics Theses and Dissertations
|
This item is protected by original copyright
|
All items in UWSpace are protected by copyright, with all rights reserved.
|
