Graph theory and combinatorics
Code  Completion  Credits  Range  Language 

MIGAK  Z,ZK  5  2P+2C  Czech 
 Lecturer:
 Tutor:
 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 0387984887.
4. Graham, R. L.  Knuth, D.  Patashnik, O. : Concrete Mathematics. AddisonWesley, 1994. ISBN 9780201558029.
 Note:
 Further information:
 No timetable has been prepared for this course
 The course is a part of the following study plans:

 Specialization Computer Science, Presented in Czech, Version 2018 to 2019 (compulsory course of the branch)