How many paths of length 5 are there in the complete bipartite graph K3,7? (Remember that a path such as v1 ? v2 ? v3 ? v4 ? v5 ? v6 is considered to be the same as the path v6 ? v5 ? v4 ? v3 ? v2 ? v1)

Hey guys so i was asked this question...could anyone help me? It would be great if there was a method explained too to how to obtain the answer since i got asked of shorter lengths too... Thx a lot!

3*7*2*6*1*5

Just go through the process of building a path and count how many choices you have at each step.

Oh so thts it! Thx a lot!