One of the main result of [1]} is that for ordered classes of graphs,
bounded twin-width is equivalent to being small.
It appears that the total order is the key for this equivalence
and suggests that dense structures are more likely to verify this equivalence.
One of our main result is indeed to show this equivalence for tournaments.
