Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Infinite families of tight regular tournaments

Bernardo LlanoMika Olsen — 2007

Discussiones Mathematicae Graph Theory

In this paper, we construct infinite families of tight regular tournaments. In particular, we prove that two classes of regular tournaments, tame molds and ample tournaments are tight. We exhibit an infinite family of 3-dichromatic tight tournaments. With this family we positively answer to one case of a conjecture posed by V. Neumann-Lara. Finally, we show that any tournament with a tight mold is also tight.

Page 1

Download Results (CSV)