SubjectsSubjects(version: 953)
Course, academic year 2023/2024
   Login via CAS
Combinatorics and Graph Theory 2 - NDMI012
Title: Kombinatorika a grafy 2
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2021
Semester: summer
E-Credits: 5
Hours per week, examination: summer 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: Czech, English
Teaching methods: full-time
Teaching methods: full-time
Guarantor: prof. Mgr. Zdeněk Dvořák, Ph.D.
doc. RNDr. Vít Jelínek, Ph.D.
Class: Informatika Bc.
Classification: Informatics > Discrete Mathematics
Incompatibility : NDMX012
Interchangeability : NDMX012
Is incompatible with: NDMA002, NDMI032, NDMX012
Is interchangeable with: NDMI032, NDMX012, NDMA002
Annotation -
The lecture extends NDMI011. An overview lecture on classical results in combinatorics and graph theory.
Last update: T_KAM (20.04.2008)
Course completion requirements -

LS 2023/24, English session (Babak Ghanbari): The credit will be awarded based on 2-3 short tests, active participation in the class and the homework solutions.

Tutorial credit is a prerequisite for taking the exam.

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

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

H. Wilf: Generatingfunctionology (

Last update: Jelínek Vít, doc. RNDr., Ph.D. (23.06.2016)
Requirements to the exam -

The exam will be oral, with an opportunity for written preparation. The content of the exam corresponds to the syllabus of the course, as covered at the lectures. The students must also demonstrate the ability to apply (and generalize) the results from the lecture in solving combinatorial exercises. Before taking the exam, a candidate must first get credit from the tutorial.

Last update: Jelínek Vít, doc. RNDr., Ph.D. (14.02.2023)
Syllabus -

Matchings in general graphs.

Hamiltonian cycles, Ore condition, Chvátal closure.

Surfaces of higher genus, generalized Euler's formula, Heawood's formula.

Lemma on the contractible edge, Tutte's theorem on 3-connected graphs, Kuratowski's theorem.

Graph coloring, Brooks' theorem, Vizing's theorem.

Tutte polynomial: equivalent definitions, important points, cycle space, and cut space of a graph.

Ordinary and Exponential Generating Functions.

Burnside's lemma, Polya's enumeration, examples of applications.

Sunflower theorem, Erdös-Ko-Rado Theorem, Turan's Theorem

Perfect graphs, Dilworth's theorem.

Chordal graphs.

Last update: Dvořák Zdeněk, prof. Mgr., Ph.D. (27.09.2020)
Charles University | Information system of Charles University |