Global ETD Search

1	Packing Directed Joins Williams, Aaron January 2004 (has links) 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. Mathematics directed graph directed cut directed join min-max Woodall's Conjecture Edmonds-Giles Conjecture
2	Packing Directed Joins Williams, Aaron January 2004 (has links) 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. Mathematics directed graph directed cut directed join min-max Woodall's Conjecture Edmonds-Giles Conjecture