HW 2: due Tues, September 20th
1. In class we defined an edge cover Uto be a subset of vertices of G
so that any edge in Ghas at least one of its endpoints in the set U.
For each integer k, give an example graph Gwhere the gap between
the size of the minimum edge cover in Gand the size of the maximum
matching in Gis k.
2. Read Chapter 2 of the text
3. Do the following problems from the text: 2.11, 2.16, 2.20, 2.25, 2.35,
2.36
4. Extra credit: 2.29 – 2.32.