***********************************
* Princeton Discrete Math Seminar *
***********************************
Date: Thursday 15th March, 2.15 in Fine Hall 224
Speaker: Ben Clark, U. Wellington
Title: Tangles, trees, and flowers
Identifiable regions of high connectivity in a matroid or graph are captured
by the notion of ``tangles''. For a tangle of order k in a matroid or graph
that satisfies a certain robustness condition, we describe a tree
decomposition of the matroid or graph that displays, up to a certain
natural equivalence, all of the k-separations of the matroid or graph
that are non-trivial with respect to the tangle. This is joint work
with Geoff Whittle.
-----------
Next week: spring recess, no seminar
Anyone wishing to be added to or removed from this mailing list should
contact Paul Seymour (pds@math.princeton.edu)