What is the maximum number of hamilton paths a graph with $n$ vertices can have without having a hamiton cycle ?
If my turbo pascal program works well, the first few values for $3,4,...$ vertices are $2,4,12,48,240$ , which approves the conjecture that $2(n-2)!$ is the maximum.