Eplett's theorem for self-converse generalised tournaments
classification
🧮 math.CO
keywords
tournamentconverseeplettgeneralisedself--conversesequencetournamentsarcs
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.