PristupačnostSelected topics in discrete mathematics
Data is displayed for the academic year: 2025./2026.
Lecturers
Course Description
Discrete mathematics is an area of mathematics whose progress is strongly motivated by solving various engineering problems. One of the most interesting and important structures is a graph, which finds numerous applications in various networks. In this course, we will present the following contemporary topics: combinatorial optimization; graphs; coloring of graphs and application to solving the problem of scheduling; the problem of community detection; software testing and orthogonal arrays; design and planning of experiments; Latin squares and their application in statistics.
Study Programmes
Postgraduate doctoral study programme
Literature
Dieter Jungnickel (2013.), Graphs, Networks and Algorithms, Springer
A.S. Hedayat, John Stufken, N.J.A. Sloane (1999.), Orthogonal Arrays. Theory and Applications., Springer Science+Business Media New York
General
ID 254203
Summer semester
6 ECTS