A basic result in Ramsey theory states that any tournament contains a “large” transitive subgraph. Since transitive tournaments contain only transitive subgraphs, it is natural to ask which subgraphs must appear in any large tournament that is “far” from being transitive. One result of this type was obtained by Fox and Sudakov who characterized the tournaments that appear in any tournament that...

A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In addition, the proposed algorithm yields a solution that meets both the norepeater and mirrored co...

This paper analyses the relationship between workers’ gender and monetary incentives in an experimental setting based on a double-tournament scheme. The participants must choose between a piece-rate payment or a performance prize. The results show that women tend to shy away from competition, and are less sensitive than men to the monetary incentives of the tournament. In addition the tournamen...

Using Rado’s theorem for the existence of an independent transversal of family of subsets of a set on which a matroid is defined, we give a proof of Landau’s theorem for the existence of a tournament with a prescribed degree sequence. A similar approach is used to determine when a partial tournament can be extended to a tournament with a prescribed degree sequence. Mathematics Subject Classific...

For a tournament $H$ with $h$ vertices, its typical density is $h!2^{-\binom{h}{2}}/aut(H)$, i.e. this the expected of in random tournament. A family ${\mathcal F}$ $h$-vertex tournaments {\em dominant} if for all sufficiently large $n$, there exists an $n$-vertex $G$ such that each element larger than by constant factor. Characterizing dominant families challenging already small $h$. Here we c...

In this paper we use tournament matrices to give a combinatorial interpretation for the entries of the inverse t-Kostka matrix, which is the transition matrix between the Hall-Littlewood polyno-mials and the Schur functions. 0.1 Introduction In the rst section of this paper we introduce some basic notation about tournament matrices, and prove a theorem that is crucial in the second section. In ...