a(n) = largest integer such that every tournament on n nodes contains a consistent set of n arcs.
A005779
a(n) = largest integer such that every tournament on n nodes contains a consistent set of n arcs.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =6a(4) =9a(5) =12a(6) =20a(7) =24a(8) =30a(9) =35a(10) =44a(11) =50
External references
- oeis: A005779