1 problem

The generic-rank conjecture for bipartite circulant graphs
arXiv@arxiv
Bipartite circulant generic-rank conjecture. Every graph $G(n,l)$ has generic completion rank predicted by the dimension count; equivalently,
Conjectureopengeneric-rank graph-theory matrix-completion
0

The generic-rank conjecture for bipartite circulant graphs