Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2024/2025

Graph theory and combinatorics

The course is not on the list Without time-table
Code Completion Credits Range Language
NIE-GAK Z,ZK 5 2P+2C English
Garant předmětu:
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:

We expect knowledge of topics from the courses Algorithms and graphs I. and II. (BI-AG1, BI-AG2).

Syllabus of lectures:

List of the topics

1. Generating functions

2. Graph coloring and perfect graphs

3. Introduction to Ramsey theory

4. Matching in general graphs

5. Counting spanning trees

6. Introduction to probabilistic method

7. Extremal combinatorics

8. Planar graphs and Kuratowski theorem

9. Coloring graphs on surfaces

10. List coloring and choosability

11. Edge coloring

12. Combinatorial games

Syllabus of tutorials:

1. Generating functions

2. Graph coloring and perfect graphs

3. Introduction to Ramsey theory

4. Matching in general graphs

5. Counting spanning trees

6. Introduction to probabilistic method

7. Extremal combinatorics

8. Planar graphs and Kuratowski theorem

9. Coloring graphs on surfaces

10. List coloring and choosability

11. Edge coloring

12. Combinatorial games

Study Objective:
Study materials:

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

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

3. Diestel, R. : Graph Theory. Springer, 2016. ISBN 978-3-662-53621-6.

Note:
Further information:
https://courses.fit.cvut.cz/NIE-GAK/
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2024-05-01
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet6770706.html