Subjects
The scientific activity of employees of the Department of Discrete Mathematics concerns discrete mathematics with particular emphasis on graph theory, combinatorics and issues in theoretical computer science.
More precisely, these include the following topics:
- Packing of graphs, digraphs and hypergraphs
- Decompositions of graphs, digraphs and hypergraphs (cyclic partitions of the complete graphs and hypergraphs; self-complementary graphs and hypergraphs)
- Arbitrary decompositions
- Arbitrary partitions
- Cycles and paths in graphs (in particular, hamiltonian issues)
- Extremal problems (graphs and hypergraphs saturated with respect to paths, (H,k) stable graphs of minimal size)
- Partitions (linear partitions of cubic graphs, geometric partitions)
- Colourings and labelings of graphs (e.g., vertex-distinguishing edge colourings)
- Topological aspects (knot theory)
- Theoretical computer science
There is also a research group within the Department of Discrete Mathematics, the Graph Theory Group.
