PristupačnostSelected topics in discrete mathematics
Data is displayed for academic year: 2023./2024.
Lecturers
Course Description
Discrete mathematics is a branch of mathematics whose progress is strongly motivated by solving various engineering problems. Discrete mathematics is a study of different finite structures and their applications. One of the most interesting structures is the mathematical concept of a graph, which finds numerous applications in various networks. In this course, contemporary topics will be presented: graphs; coloring of graphs and application to solving the problem of scheduling; the problem of community detection; software testing and orthogonal arrays; experiment planning; application of orthogonal arrays in statistics; factorial 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
For students
General
ID 254203
Summer semester
6 ECTS
L3 English Level