Combinatorics2007jan - with at most 4 objects of any one...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Qualifying Exam in Combinatorics 12 January, 2007 1. Suppose that G is a graph with no vertex of valence < 5, exactly 13 vertices of valence 5, no vertex of valence 7, and possibly an assortment of vertices of other valences. (a) What is the least number e 0 of edges that G may have? (b) If G has exactly e 0 edges, determine whether it is possible for G to be planar. 2. Suppose that ( P, P ) is a cut in a network N with capacity function w . where P contains the source and P contains the sink. Suppose that a flow ϕ in N has the property that whenever x P and y P , then ϕ ( x, y ) = w ( x, y ). Can you conclude that ϕ must be a maximum flow, or that ( P, P ) is a minimum cut? If your answer is yes, prove it; if your answer is no, verify it by constructing a counterexample. 3. Count the number of selections of 15 objects of five different kinds
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: with at most 4 objects of any one kind in each of the following two ways: [Obtain a numerical answer each time.] (a) by the Principle of Inclusion-Exclusion; (b) by constructing an appropriate generating function and evalu-ating an appropriate coecient. 4. Construct two non-isomorphic, self-dual, rank 3 matroids on 6 ele-ments; also construct a rank three matroid on 6 elements that is iso-morphic to its dual but not self- dual. 5. (a) Dene a projective plane, dene Latin square and dene or-thogonal Latin squares. (b) State a theorem that relates projective planes and orthogonal Latin squares and sketch its proof. 1...
View Full Document

This note was uploaded on 06/19/2011 for the course MATH 680 taught by Professor Na during the Spring '11 term at University of North Carolina School of the Arts.

Ask a homework question - tutors are online