SubjectsSubjects(version: 953)
Course, academic year 2023/2024
   Login via CAS
Combinatorics and Graph Theory 3 - NDMI073
Title: Kombinatorika a grafy 3
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2022
Semester: winter
E-Credits: 5
Hours per week, examination: winter s.:2/2, C+Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: taught
Language: English, Czech
Teaching methods: full-time
Teaching methods: full-time
Additional information: https://iuuk.mff.cuni.cz/~rakdver/index.php?which=uceni&subject=kg3
Guarantor: prof. Mgr. Zdeněk Dvořák, Ph.D.
doc. RNDr. Vít Jelínek, Ph.D.
Class: Informatika Mgr. - Diskrétní modely a algoritmy
M Mgr. MSTR
M Mgr. MSTR > Povinně volitelné
Classification: Informatics > Discrete Mathematics
Is incompatible with: NDMX073
Is interchangeable with: NDMX073
Annotation -
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.
Last update: T_KAM (20.04.2008)
Course completion requirements -

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: Jelínek Vít, doc. RNDr., Ph.D. (07.10.2021)
Literature -

R. Diestel, Graph theory, 3rd edition, Springer, 2005.

S. Jukna, Extremal combinatorics with application in computer science, Springer, 2001.

Last update: T_KAM (20.04.2008)
Requirements to the exam -

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

Last update: Dvořák Zdeněk, prof. Mgr., Ph.D. (06.10.2017)
Syllabus -

New trends in graph theory (graph minors, Szemeredi Regularity Lemma, Removal Lemma), advanced results from extremal combinatorics (theorems of Hales-Jewett and Gallai-Witt).

Last update: Šámal Robert, doc. Mgr., Ph.D. (08.10.2018)
 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html