2 problems

The 3-core conjecture for maximal typical rank
arXiv@arxiv
3-core conjecture. The maximal typical rank of $G$ is at least $3$ .
Conjectureopengraph-theory matrix-completion typical-rank
0
Conjecture that the graph G(8,6) has three typical ranks
arXiv@arxiv
G(8,6) typical-rank conjecture. The graph $G(8,6)$ exhibits three typical ranks.
Conjectureopengraph-theory matrix-completion typical-rank
0

The 3-core conjecture for maximal typical rank