2016•arXiv (Cornell University)Open access

Eplett's theorem for self-converse generalised tournaments

Erik Thörnblad

Abstract

The converse of a tournament is obtained by reversing all arcs. If a tournament is isomorphic to its converse, it is called self--converse. Eplett provided a necessary and sufficient condition for a sequence of integers to be realisable as the score sequence of a self--converse tournament. In this paper we extend this result to generalised tournaments.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Converse, Tournament, Mathematics, Sequence (biology), Combinatorics, Discrete mathematics, Mathematical economics, Geometry