|
| |
|
|
A122027
|
|
Largest integer m so that every n-tournament contains a transitive (i.e. acyclic) sub-tournament with at least m vertices.
|
|
1
| |
|
|
1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
