- The final exam is now graded.
- Here are the Final exam solutions.
- The Final exam is due Tuesday, 12/17 by 5PM
either in my office or with Carrie.
- If you find a proof in a book, paper, ... then write up the proof
in your own words and then state precisely the source (including author
and exact page number.)
- If in some problem you can't solve part a), then in part b) you
may still use part a) and get full credit for b). Of course for a)
you would at best get partial credit.
- #2 a): Erdos-Renyi '60 is useful, but first you must determine what
t is. Hints: 0 << t << 1/n and "Second moment method".
- #3: if you can find an argument which is not probabilistic you will
get at least 50% partial credit: often counting arguments can be easily
translated into a probabilistic framework (compare Erdos '47 from lectures 3
and 16.)
- #3: do not pick the edges randomly (that will usually not be bipartite)
but somehow pick the partition randomly.
- #4a): do not attempt to modify the 2-color construction too much,
but see instead how you can USE it.
- #6b): this still has to be a rigorous "proof", but if you
understand the question properly, then the proof is short and mainly
invokes a result we already proved.
- Treat this like an open book, open notes, open anything in-class
exam.
- You may come and talk to me about questions.
- You may not talk to any of your class mates about
any aspect of the final. This includes asking
"Have you started/finished yet?". In short: if it is not allowed in
a regular exam, then it is not allowed here either!
- You may use any other resource as long as you acknowledge it,
by clearly indicating for every problem which reference material you used.
- Schedule for the 75-minute student presentations:
- 11/21: Jason Wilson, Constructions using Finite Fields.
- 11/26: Megan Spangler, Induced Ramsey problems.
- 12/03: Jessica Jones, Ramsey problems in Number Theory.
- 12/05: Tina Shinsato, Ramsey problems in Geometry.
- 12/10: Chuck Buchwald, Ramsey problems for Tournaments and Digraphs.
- 12/12: Camelia Mihele, More Graph Ramsey Theory.
|
Course announcements: