Rozklady grafů při rozpisu střelecké soutěže

Abstract

This bachelor's thesis is based on 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. To find on optimal schedule known graph theory methods as decomposition of complete graphs, factorization, canonical factorization, proper edge coloring are used in dependancy on the number of registered players. We also use one of the basic combinatorial designs which are latin squares. In this thesis the real problem is converted into a theoretical level and procedures for constructions of schedules are described. Procedures are generalized for some certain infinity classes of registered players.