|
Fair incomplete tournamentsAn extended paper on 1VMV labelings of graphs on even number of vertices by Tereza, Dalibor and me. AbstractA fair incomplete tournament of n teams with k rounds is a tournament in which every team plays exactly k other teams and moreover the total strength of the opponents that each team misses during such tournament is the same for all teams. In our article we completely characterize such tournaments for n even. Status
Published in the Annual proceedings of Science and Technology at VŠB - TUO.
|