Discrete Mathematics II
Winter 2011/12.

Instructor.

  • Tibor Szabó
  • Phone: 838-75217
  • Office: 211, Arnimallee 3
  • Email: szabo at math dot fu-berlin dot de
    • Top of page

    Time.

  • Lectures: Tuesdays, 8:30 - 10:00, Arnimallee 6 SR 032 and Wednesdays, 8:30 - 10:00, Arnimalle 6 SR 007/008.
  • Exercises: Tuesdays, 12:30 - 14:00, Arnimallee 6 SR 032.
    • Top of page

    Topics of the course.

  • Graph Theory: matchings, colorings, planarity, Hamiltonicity.
  • Extremal Combinatorics: set systems, forbidden substructures, Regularity Lemma, Ramsey theory, Roth's Theorem.
  • Methods of Combinatorics: probabilistic, linear algebraic, algorithmic, topological.
    Top of page

    Prerequisites.

  • basic graph theory, combinatorics, algebra, calculus
    Top of page

    Requirements.

    Here you can read the requirements and formalities of the course.
    Top of page

    Final.

  • Final exam: February 21st, 10:00 - 12:00, Room: HS 001, Arnimallee 3.
  • Make-up final exam: March 28th, 10:00 - 12:00 Room: HS 001, Arnimallee 3..
    Top of page

    Exercises.

    You find the exercises and the dynamic list of material here.
    Top of page

    Literature.

  • N. Alon, J. Spencer, The Probabilistic Method.
  • R. Diestel, Graph Theory.
  • S. Jukna, Extremal Combinatorics.
  • J. van Lint, R. Wilson, A course in Combinatorics.
  • D. West, Introduction to Graph Theory.
    Further reading:
  • B. Bollobás, Combinatorics.
  • L. Lovász, Combinatorial Problems and Exercises.