-
Notifications
You must be signed in to change notification settings - Fork 66
Paradoxical tournaments #942
Copy link
Copy link
Open
Labels
difficulty: 1A label for feature requests of moderate difficultyA label for feature requests of moderate difficultynew-featureA label for new features.A label for new features.newcomer-friendlyA label for issues that someone thought might be friendly newcomers.A label for issues that someone thought might be friendly newcomers.
Description
Activity
Metadata
Metadata
Assignees
Labels
difficulty: 1A label for feature requests of moderate difficultyA label for feature requests of moderate difficultynew-featureA label for new features.A label for new features.newcomer-friendlyA label for issues that someone thought might be friendly newcomers.A label for issues that someone thought might be friendly newcomers.
Type
Projects
- StatusShow more project fieldsUnassigned
A tournament is a digraph with exactly one edge between each two vertices, in one of the two possible directions. (We have these already.)
A tournament is paradoxical (aka 1-paradoxical) if every vertex has at least one in-neighbour (i.e. if each player loses at least one game).
A tournament is$n$ -paradoxical if which all possible sets of $n$ vertices have a common in-neighbour (i.e. if any set of $n$ players has some opponent that beat them all).
It'd be nice to have something in the package for those last 2, and probably wouldn't be hard.