SEMINAR: Groups and Combinatorics: Packing Steiner trees
|
|
Groups and Combinatorics Seminar
Irene Pivotto (UWA)
will speak on
Packing Steiner trees
at 1pm Tuesday 2nd of October in MLR2
Abstract: A classic theorem of Nash-Wiliams and Tutte gives necessary and sufficient conditions for a graph to
have k pairwise edge-disjoint spanning trees. We will discuss the natural generalization of this problem to trees
spanning a distinguished set of vertices (which we refer to as Steiner trees). Finding edge-disjoint spanning trees is a
considerably easier problem that finding edge-disjoint Steiner trees. This is due to the fact that spanning trees are
bases of the natural matroid associated with a graph, while Steiner trees are not bases of any matroid. We will
present a result that provides sufficient conditions for the existence of k edge-disjoint Steiner trees, reducing this
problem to finding disjoint bases of a particular matroid. No prior knowledge of matroid theory is required to
attend the talk.
Speaker(s) |
Irene Pivotto
|
Location |
Maths Lecture Room 2
|
|
Contact |
Michael Giudici
<[email protected]>
|
Start |
Tue, 02 Oct 2012 13:00
|
End |
Tue, 02 Oct 2012 13:45
|
Submitted by |
Michael Giudici <[email protected]>
|
Last Updated |
Fri, 28 Sep 2012 14:16
|
Included in the following Calendars: |
|
- Locations of venues on the Crawley and Nedlands campuses are
available via the Campus Maps website.
- Download this event as:
Text |
iCalendar
-
Mail this event:
|