3 problems

Let $G$) be a simple assembly graph with $n$ rigid vertices, each of degree $4$, and let $F_k$ denote the $k$th Fibonacci number. A Hamiltonian set of polygonal paths is a Hamilton…

Genus-range classification conjecture. For any $m\in\mathbb N$, there is an integer $\Psi_m\geq\psi_m$ such that

Maximum-genus-range conjecture. The maximum genus range of assembly graphs with $2n$ vertices is