Hamiltonian Sets of Polygonal Paths in Assembly Graphs

We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative its size. These conditions serve to prove the conjecture that such maximum, which is equal to $F_{2n+1}-1$, where $F_k$ denotes the $k$th Fibonacci number, is achieved only for special assembly graphs, called tangled cords.