Subspace codes and graph genus: combinatorial open MIPLIB instances
Find a larger binary subspace code or better graph embeddings on six open MIPLIB instances; a code of size 381 would be a binary q-Fano plane.
Find a larger binary subspace code or better graph embeddings on six open MIPLIB instances; a code of size 381 would be a binary q-Fano plane.