|
|
|
||
Last update: T_KAM (20.04.2008)
|
|
||
Last update: doc. RNDr. Vít Jelínek, Ph.D. (07.10.2021)
Passing grade for tutorials (zápočet) is obtained on the basis of active participation, or homework. The nature of these requirements precludes retakes. Passing grade for tutorials is required before taking the exam, this can be relaxed at the discretion of the lecturer in exceptional cases (early exam dates). |
|
||
Last update: T_KAM (20.04.2008)
R. Diestel, Graph theory, 3rd edition, Springer, 2005.
S. Jukna, Extremal combinatorics with application in computer science, Springer, 2001. |
|
||
Last update: prof. Mgr. Zdeněk Dvořák, Ph.D. (06.10.2017)
Oral exam consisting of 2-3 questions on subjects covered by the lectures. |
|
||
Last update: doc. Mgr. Robert Šámal, Ph.D. (08.10.2018)
New trends in graph theory (graph minors, Szemeredi Regularity Lemma, Removal Lemma), advanced results from extremal combinatorics (theorems of Hales-Jewett and Gallai-Witt). |