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.
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.