Discrete Mathematics III --- Constructive Combinatorics
Summer 2012.

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, 12:30 - 14:00, Arnimallee 6 SR 032. Regular timeslot for make-up lectures (in case necessary): Mondays, 8:30 - 10:00, Arnimalle 3 SR 119.
  • Exercises: Tuesdays, 8:30 - 10:00, Arnimallee 6 SR 007/008.
    • Top of page

    Topics of the course.

  • Explicit extremal constructions for Turán- and Ramsey-type problems, finite fields, projective geometries, quasirandom graphs, eigenvalues of graphs, discrete Fourier transform
    Top of page

    Prerequisites.

  • basic extremal graph theory, probability, algebra, calculus
    Top of page

    Requirements.

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

    Final. (CHANGED!!!)

  • Oral final exam: possible dates: August 13th, August 29th, September 25th
    PLEASE LET ME KNOW YOUR PREFERENCE BY JULY 5th.
    Top of page

    Exercises.

    Exercise Sheet 1.
    Exercise Sheet 2.
    Exercise Sheet 3.
    Exercise Sheet 4.
    Exercise Sheet 5. (updated: 22.5)
    Exercise Sheet 6. (corrected typo in Problem 2: 14.6)
    Exercise Sheet 7. (corrected small typo: 27.7)
    Exercise Sheet 8.
    Top of page

    Literature.

  • Lecture notes Constrctive symmetric Ramsey notes.

    Further reading:
  • N. Alon, J. Spencer, The Probabilistic Method.
  • R. Diestel, Graph Theory.
  • S. Jukna, Extremal Combinatorics.
  • D. West, Introduction to Graph Theory.