Aplikace metod diskrétní matematiky při sestavování rozpisů sportovní střelecké soutěže.

Abstract

The thesis is inspired by a problem of constructing a schedule for the real sports shooting competition. In this competition every two players play one game against each other - it is a tournament. Combinatorial designs, primarily special types of designs called balanced tournament designs and factored ballanced tournament designs are used to find an optimal schedule. Further the known graph theory methods for tournament scheduling are used. In the thesis constructions of schedules are described depending on the number of registered players. Resulting schedules of all types of constructions are summarized and compared with the respect to an achievement of fair conditions for all players.