Jump to main content
Chair of Theoretical Computer Science and Information Security
Chair of Theoretical Computer Science and Information Security

From spanning forests to edge subsets

Talking persons:
Dipl.-Math. Martin Trinks
Abstract:
We give some insight into Tutte´s definition of internally and externally active edges for spanning forests. Namely we prove, that every edge subset can be constructed from the edges of exactly one spanning forest by deleting a unique subset of the internally active edges and adding a unique subset of the externally active edges.
Times:
Tuesday 28th June 2011, 3.00 pm - 3.30 pm, room 1/219