We know that counting the number of Hamiltonian paths is in $\#\mathsf{P}$.So, what complexity (counting version) class would the counting the number of Hamiltonian paths that have two or three particular vertexes in a graph be in?Also, what would be like if counting the number of hampaths that have two or three particular vertexes in particular place - so, for example, calculating the hampath that has vertex 3 as the second place from starting point and so on?
#P complexity reduction
complexity theory