This preview shows page 1. Sign up to view the full content.
Unformatted text preview: G , and let : E ( G ) IR + be an st Fow. Show that there is an st Fow : E ( G ) ZZ + so that (a) its value is at least that of , and (b)  ( e ) ( e )  < 1 for every edge e of G . 4. Let T be a tree. Show that T has a perfect matching if and only if for every vertex v , exactly one of the components of T \ v has an odd number of vertices. [Hint for if: use induction on  V ( T )  , nd a leaf with a neighbour of degree 2, and delete them both.] 1...
View
Full
Document
 Spring '10
 chudnovsky

Click to edit the document details