Atlas home || Conferences | Abstracts | about Atlas
Host: University of Waterloo
Sponsor: University of Waterloo, Fields Institute
Homepage: http://www.fields.utoronto.ca/gt-matroids.html
Email: matroids@fields.utoronto.ca
Organizers: W.H. Cunningham, University of Waterloo, A. Frank (Eötvös University, Budapest), J.F. Geelen (University of Waterloo), A. Sebö (CNRS, Grenoble)
Description:
In the 1960's Edmonds first called attention to an apparent dichotomy between the (polynomially) solvable problems and other
problems, which he conjectured to be unsolvable. He also proved that several important models associated with graph
matching and matroids are solvable, and observed an apparent connection between solvability and the existence of certain of
these structures. In the ensuing thirty years there has been increasing recognition, both of the importance of his results and the
validity of his hypothesis. But there have also been explanations of his results, such as the connection between submodular
functions and convexity, and beautiful extensions, including submodular function minimization, submodular flows, bisubmodular
functions, submodular coverings, matroid parity, delta-matroids, jump systems, path-matchings, valuated matroid intersection.
These have led to the solution of problems in areas as diverse as network design and algebraic complexity.
The objective of this workshop is to bring together researchers from various areas with the goal of finding further connections, extensions and applications for these models.
Date received: September 30, 1999
© 2008 Atlas Conferences Inc.