3 problems

The $D^2_n$ non-TRVG conjecture
arXiv@arxiv
The $D^2_n$ non-TRVG conjecture. $D^2_n$ is a non-TRVG when $n\ge10$ .
Conjectureopengeometric-representations graph-theory visibility-graphs
0
The non-TRVG conjecture for $D^a_n$ in the remaining range
arXiv@arxiv
The $D^a_n$ non-TRVG conjecture. $D^a_n$ is a non-TRVG when $2a+5\le n\le 2a+7$ and $a\ge 3$ .
Conjectureopengeometric-representations graph-theory visibility-graphs
1
The minimum-edge non-TRVG conjecture for $K_{3,5}$
arXiv@arxiv
Minimum-edge non-TRVG conjecture. $K_{3,5}$ is a non-TRVG with the least number of edges.
Conjectureopengeometric-representations graph-theory visibility-graphs
0

The Dn2D^2_nDn2​ non-TRVG conjecture