Extremal problems in metric theory of graphs and discrete structuresSupervisor: prof. RNDr. Martin Knor, PhD.
This page shows details on the project. The primary projects are displayed together with a list of sub-projects.
|Project description:||The project will focus on a selection of problems in extremal graph theory related to distances in graphs and discrete structures. We will consider the degree-diameter problem, the problem of trees satisfying certain equality for the Wiener index of line-graph iterations, the extremal problem of distance domination in (di)graphs, as well as distance-related problems on Steiner triple systems. All the problems under consideration are part of pure mathematics research; they have attracted world-wide attention and will be approached in collaboration with international experts.|
|Kind of project:||VEGA ()|
|Department:||Department of Mathematics and Constructive Geometry (FCE)|
|Project status:||Successfully completed|
|Project start date :||01. 01. 2013|
|Project close date:||31. 12. 2015|
|Number of workers in the project:||2|
|Number of official workers in the project:||0|