Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Graph theory and combinatorics

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
MI-GAK Z,ZK 5 2P+2C Czech
Lecturer:
Štěpán Starosta (guarantor), Tomáš Valla
Tutor:
Štěpán Starosta (guarantor), Václav Blažej, Tomáš Valla
Supervisor:
Department of Theoretical Computer Science
Synopsis:

The goal of the class is to introduce the most important topics in graph theory, combinatorics, combinatorial structures, discrete models and algorithms. The emphasis will be not only on undestanding the basic principles but also on applications in problem solving and algorithm design. The topics include: generating functions, selected topics from graph and hypergraph coloring, Ramsey theory, introduction to probabilistic method, properties of various special classes of graphs and combinatorial structures. The theory will be also applied in the fields of combinatorics on words, formal languages and bioinformatics.

Requirements:
Syllabus of lectures:
Syllabus of tutorials:
Study Objective:
Study materials:

1. Matoušek, J. - Nešetřil, J. : Kapitoly z diskrétní matematiky. Karolinum Praha, 2010.

2. Valla, T. - Matoušek, J. : Kombinatorika a grafy. ITI Series, 2005.

3. Bollobas, B. : Modern Graph Theory. Springer, 1998. ISBN 0-387-98488-7.

4. Graham, R. L. - Knuth, D. - Patashnik, O. : Concrete Mathematics. Addison-Wesley, 1994. ISBN 978-0-201-55802-9.

Note:
Further information:
https://courses.fit.cvut.cz/MI-GAK/
Time-table for winter semester 2019/2020:
Time-table is not available yet
Time-table for summer semester 2019/2020:
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue
roomTH:A-1242
Valla T.
11:00–12:30
(lecture parallel1)
Thákurova 7 (FSv-budova A)
roomTH:A-1242
Valla T.
Blažej V.

12:45–14:15
(lecture parallel1
parallel nr.101)

Thákurova 7 (FSv-budova A)
Fri
Thu
Fri
The course is a part of the following study plans:
Data valid to 2020-05-31
For updated information see http://bilakniha.cvut.cz/en/predmet5523206.html