Oberwolfach Reports


Full-Text PDF (468 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 2, Issue 1, 2005, pp. 135–183
DOI: 10.4171/OWR/2005/03

Published online: 2005-12-31

Graph Theory

Reinhard Diestel[1], Alexander Schrijver[2] and Paul Seymour[3]

(1) Universit├Ąt Hamburg, Germany
(2) Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands
(3) Princeton University, USA

This conference was one of a series of Oberwolfach conferences, held every two years or so, with focus on graph structure, decomposition, and representation. There were 49 participants, including over a dozen graduate students and postdocs. At the request of the Oberwolfach Director, the conference schedule was designed to promote informal collaboration. In particular, there were fewer formal talks than usual, and instead there were a number of discussion groups or ``workshops'. Also, the first day (except for one plenary talk) was devoted to having the participants introduce themselves -- we asked all participants to give a five-minute presentation of their current interests. We were fortunate in that several of the plenary talks described major new results. For instance, Ron Aharoni and Eli Berger have just solved the ErdH{o}s-Menger conjecture; Bertrand Guenin has proved a major extension of the four-colour theorem; and Stephan Brandt and St'ephan Thomass'{e} have settled a long-standing question about the chromatic number of dense graphs. But probably the most distinctive feature of the meeting were the workshops. Some of these were planned before the conference, and others were held spontaneously. They were each on a topic with a chairman, but made as informal as possible. Some were more or less a sequence of talks on the topic, some were monologues, and some were genuine discussions. There were several different topics: infinite graphs and Ramsey theory, matroid theory, connectivity, graph minors and width, and topological methods. Three topics in particular gave rise to particularly active and long-running workshops: the proof of the ErdH{o}s-Menger conjecture, the prospects of extending the graph minors project to matroids, and the use of topological methods for combinatorial problems. Our thanks to the organizers of the workshops for making them run successfully, to the Director for encouraging us to try out new ways of informal collaboration, and to all the participants for making this a highly stimulating meeting.

No keywords available for this article.

Diestel Reinhard, Schrijver Alexander, Seymour Paul: Graph Theory. Oberwolfach Rep. 2 (2005), 135-183. doi: 10.4171/OWR/2005/03