  A homogeneous tournament is a tournament with 4t + 3 vertices that every arc
is contained in exactly t + 1 cycles of length 3. A generalized class of graph
is that of near-homogeneous tournaments with 4t+1 vertices, in which every arc
is contained in t or t + 1 cycles of length 3. In this paper, we raise a new
method to construct near-homogeneous tournaments with 4t + 1 vertices. We also
extend the definition of near-homogeneous tournament to those tournaments with
an even number of vertices. We prove a few results that support the rationality
of our definition. Finally we construct some infinite classes of
near-homogeneous tournaments with even number of vertices as we define.

Combinatorics