Combinatorics II (MAD 4204) — Spring 2011 Due Wednesday 2/2/2011 Homework #3 Announcement: The four in-class midterms will be on 2/9, 3/2, 3/23, and 4/13 (all are Wednesdays). They are not intended to be cumulative, but that is sometimes diFcult to accomplish. 1 Construct a (countably) infnite counterexample to Hall’s Marriage Theorem. 2 An independent set in a graph G is a set oF vertices with no edges between
This is the end of the preview. Sign up
access the rest of the document.