Combinatorics and Graphs 1 (NDMI011) -- lecture
The lecture takes place every Tuesday at 9.00 in S9.
The lecture is given by Pepa Tkadlec. E-mail: josef.tkadlec (AT) iuuk.mff.cuni.cz
The tutorial is given by Volodymyr Kuznietsov: tutorial website
Combinatorics and Graphs 1 (NDMI011) -- lecture
The lecture takes place every Tuesday at 9.00 in S9.
The lecture is given by Pepa Tkadlec. E-mail: josef.tkadlec (AT) iuuk.mff.cuni.cz
The tutorial is given by Volodymyr Kuznietsov: tutorial website
Credit requirements:
see the tutorial website
Exam:
The exam will have a written part (starting in the morning) and an oral part (in the afternoon). More information will appear here by November 30.
Resources:
We will mostly follow the lecture notes from Zdenek Dvorak's website:
[D] Z Dvorak: Lecture notes
Other resources include:
[P] I. Penev: Combinatorics and Graph Theory 1 & 2 (pdf).
[MN] J. Matoušek, J. Nešetřil: Invitation to discrete mathematics, 2nd edition, 2008.
Material covered:
We will mostly follow the lecture notes of Zdenek Dvorak from last year. See Zdenek's website.
[plan] Lecture 1 (Sept 29): [D]-Lesson 1, without subsection 1.1.4.
Intro to combinatorics (exact formulas, recurrences, asymptotically precise estimates, growth rates, equivalences). Generating functions as an important tool for each of these possible outcomes.
bonus [just for fun]: formula for the n-th prime
bonus: 52! is a very large number
[plan] Lecture 2 (Oct 6): [D]-Lesson 2.
...