Neki prilozi teoriji turnira

Petrović, Vojislav

Some contributions to the theory of tournaments

Abstract

Turniri su najviše istraživana klasa orijentisanih grafova. U tezi su prezentovana dva tipa rezultata. Prvi se odnosi na tzv. neizbežne podgrafove. Obuhvata Hamiltonove bajpase, podgrafove C(n, i) i alternativne Hamiltonove konture. Drugi se bavi problemima frekvencija skorova u običnim, bipartitnim i 3-partitnim turnirima.

Tournaments are the most investigated class of oriented graphs. Two type of results are presented in the thesis. First one is related to so called unavoidable subgraphs. It discusses Hamiltonian bypasses, subgraphs C(n, i) and antidirected Hamiltonian cycles. The second deals with problems of score frequencies in ordinary, bipartite and 3-partite tournaments.

Faculty:
University of Novi Sad, Faculty of Science
Date:
04-12-1987

Keywords:

turnir / tournament / bipartititan turnir / 3-partitan turnir / skor / frekvencija skorova / neizbežan podgraf / alternativna Hamiltonova kontura / bipartite tournament / 3-partite tournament / score / score frequency / unavoidable subgraph / antidirected Hamiltonian cycle

[ Google Scholar ]