SubjectsSubjects(version: 850)
Course, academic year 2019/2020
   Login via CAS
Combinatorics and Graph Theory III - NDMI073
Title in English: Kombinatorika a grafy III
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2019 to 2019
Semester: winter
E-Credits: 6
Hours per week, examination: winter s.:2/2 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: Czech
Teaching methods: full-time
Additional information: https://iuuk.mff.cuni.cz/~samal/vyuka/1819/KG3/
Guarantor: doc. RNDr. Vít Jelínek, Ph.D.
doc. Mgr. Zdeněk Dvořák, Ph.D.
Class: Informatika Mgr. - Diskrétní modely a algoritmy
M Mgr. MSTR
M Mgr. MSTR > Povinně volitelné
Classification: Informatics > Discrete Mathematics
Annotation -
Last update: T_KAM (20.04.2008)
The lecture extends NDMI012. An overview lecture on new trends in combinatorics and graph theory. The lecture is intended for master students or the first year PhD students.
Course completion requirements -
Last update: doc. Mgr. Zdeněk Dvořák, Ph.D. (06.10.2017)

Passing grade for tutorials (zápočet) is obtained on the basis of active participation, especially discussions of the solutions of the homework problems assigned regularly during the lectures; in exceptional cases, individual consultations can be used instead. 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).

Literature -
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.

Requirements to the exam -
Last update: doc. Mgr. Zdeněk Dvořák, Ph.D. (06.10.2017)

Oral exam consisting of 2-3 questions on subjects covered by the lectures.

Syllabus -
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).

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html