Document Sample

Graph theory, Spring-summer 2008, Exam format The exam will consist of two parts. In part one you will be asked to do one out of two questions taken from section 1 below (50 points). In part two you will be asked to do two out of three questions taken from section 2 below (25 points each). The exam will last three hours. To avoid guesswork on your part as to which questions will appear in mo’ed Aleph and Bet, the way in which I will choose the questions will be totally random. Reminder: Mo’ed Aleph is August 7th and Mo’ed Bet August 28th. The exams will be at 10:00 a.m., we will notify you of the room. Behatzlacha raba. 1 1. State and prove Tutte’s theorem 2. State and prove the Matrix Tree Theorem, and deduce Cayley’s theorem from it. 3. State and prove the mincut-maxﬂo theorem. 4. • State Szemeredi’s regularity lemma • Prove: For every > 0 there exists a δ > 0 such that the following holds: if G = (V, E) is a graph on n vertices with less than δn3 triangles, then one can remove n2 edges from G and destroy all triangles. 5. Prove that there exist graphs with arbitrarily large girth and chromatic number. 6. Deﬁne Shannon capacity and ﬁnd, with proof, the Shannon capacity of C5 . 7. Prove that every planar graph is 5-choosable. (A good reference for the proof: ”Proofs from the book”.) 1 8. Prove that there exist a positive constant K such that the following holds. Let A, B, C be sets of s real numbers each. Then |A · B + C| = |{ab + c : a ∈ A, b ∈ B, c ∈ C}| ≥ Ks3/2 . (A good reference for the proof: ”The Probabilistic Method/ Alon and Spencer.”) 2 1. Let T be a graph on n vertices. Use linear algebra to prove that any two of the following imply the third: (i) |E(T )| = n − 1 (ii) T is connected. (iii) T has no cycles. 2. Prove that if there exist two vertices in a graph, with two diﬀerent paths between them then the graph contains a cycle. 3. Prove: Every ﬁnite 2k-regular graph contains a 2-factor. 4. Prove: Every bridgeless 3-regular graph contains a 1-factor. 5. Let µ1 and µ2 be measures on a ﬁnite partially ordered set. Deﬁne stochastic domina- tion and monotone coupling, and show that µ1 stochastically dominates µ2 iﬀ there is a monotone coupling between them. 6. Prove that Mincut-Maxﬂow implies Dilworth. 7. Prove that Dilworth implies Hall. 8. Prove that any graph on n vertices has a cut (X, Y ) where |X| − |Y | is 0 or 1 and the cut contains strictly more than half the edges in the graph. 9. State and prove Turan’s theorem 10. Show there exists constants b, B such that bn3/2 ≤ Ex(n, C4 ) ≤ Bn3/2 . 11. Prove: for all d, r and s there exist t and such that the following holds: If G = (V, E) is a graph and V = V1 ∪ V2 ∪ . . . ∪ Vr where all Vi have size at least t, and every pair of sets (Vi , Vj ) spans an regular graph of density at least d then G contains a copy of the complete r-partite graph Ks,s,...,s . 2 12. • State Szemeredi’s regularity lemma • State a theorem that follows from Sz.R.L. and use it to prove Roth’s theorem. √ k 13. Prove that for k > 3 the Ramsey number R(k, k) is such that 2 ≤ R(k, k) ≤ 4k . 14. Prove that R(3, k) = O(k 2 / log k) 15. Let G be a connected d-regular graph. Show that G’s maximal eigenvalue is d, and that this eigenvalue has multiplicity 1. Show that −d is an eigenvalue iﬀ G is bi-partite. What happens if G is not connected? 16. Deﬁne the graph of the n-dimensional Hamming cube, ﬁnd its eigenvalues and eigen- vectors, and use them to ﬁnd the maximal independent sets in this graph. (It is easy to ﬁnd these sets directly...) 17. Show that K5 and K3,3 are not planar. 18. Prove that there exist graphs with chromatic number 2 and arbitrarily large choice number. 3

DOCUMENT INFO

Shared By:

Categories:

Tags:
how to, spring 2008, computer science, final exam, fall 2008, office hours, graph theory, graduate students, department of mathematics, greatest hits, dvdrip xvid, programming languages, fall 2007, the graduate, bad boys blue

Stats:

views: | 9 |

posted: | 5/14/2010 |

language: | English |

pages: | 3 |

OTHER DOCS BY tbf45647

How are you planning on using Docstoc?
BUSINESS
PERSONAL

By registering with docstoc.com you agree to our
privacy policy and
terms of service, and to receive content and offer notifications.

Docstoc is the premier online destination to start and grow small businesses. It hosts the best quality and widest selection of professional documents (over 20 million) and resources including expert videos, articles and productivity tools to make every small business better.

Search or Browse for any specific document or resource you need for your business. Or explore our curated resources for Starting a Business, Growing a Business or for Professional Development.

Feel free to Contact Us with any questions you might have.