Program:
10.3011.15: Paul Seymour Princeton University, Princeton, NJ, USA
Perfect matchings in planar cubic graphs.
A wellknown conjecture of Lovász and Plummer from the
1970's asserts that for every 2edgeconnected cubic graph G with n
vertices, the number of perfect matchings in G is exponential in n.
This seems to be wide open still, and as far as we know the best lower
bound is n/2 + 1.
In this talk we sketch a proof of the LovászPlummer conjecture
for PLANAR cubic graphs. In this case the problem is more tractable,
because we can use the fourcolour theorem as a source of
3edgecolourings and hence of perfect matchings.
This is joint work with Maria Chudnovsky, Columbia University.

11.1512.00: Jim Geelen University of Waterloo, Waterloo, Ontario, Canada
Matroid minors.
In joint work with Bert Gerards and Geoff Whittle, we hope to
extend the Graph Minors Project of Neil Robertson and Paul Seymour
to matroids representable over a fixed finite field. In this talk
we discuss the motivation for the project and report on our progress.

13.3014.15: Robin Thomas Georgia Institute of Technology, Atlanta, GA, USA
K_{t} minors in large tconnected graphs.
A graph G has a K_{t} minor if a graph isomorphic to K_{t}, the
complete graph on t vertices, can be obtained from a subgraph
of G by contracting edges. Jorgensen conjectured that every
6connected graph with no K_{6} minor has a vertex whose deletion
makes the graph planar. This is of interest, because it implies
Hadwiger's conjecture for graphs with no K_{6} minor (which is
known to be true, but Jorgensen's conjecture would give more
structural information).
I conjecture that for every integer t there exists an integer N
such that every tconnected graph on at least N vertices with no
K_{t} minor has a set of at most t5 vertices whose deletion makes
the graph planar. If true, this would be best possible in the sense
that neither tconnectivity nor the size of the deleted set can
be lowered, and for t>7 some lower bound on the number of vertices
is needed. Furthermore, no graph satisfying the conclusion of the
conjecture has a K_{t} minor.
A couple of years ago we proved the conjecture for t=6 in joint work
with Matt DeVos, Rajneesh Hegde, Kenichi Kawarabayashi, Sergey Norin
and Paul Wollan. Thus Jorgensen's conjecture holds for sufficiently
big graphs. In the talk I will report on recent progress for t>6
obtained in joint work with Sergey Norin.

14.1515.00: Carsten Thomassen Danmarks Tekniske Universitet, Lyngby, Denmark
Graph decomposition.
János Barát and I made the following conjecture: For every tree T,
there is a natural number k_{T} such that every
k_{T}edgeconnected
graph of size divisible by E(T) has an edgedecomposition into
subgraphs each isomorphic to T. The conjecture is trivial when T
has at most two edges. When we made the conjecture we could not prove it
for one single tree with three or more edges. However, we showed that
the conjecture holds for the claw (the star with three edges) provided
Tutte's 3flow conjecture is true. A year ago I verified the
conjecture for one tree. Recently, I have verified it for a second tree.

