Walks, Paths and Connectivity · Challenge problem

The wheel $W_6$ has a hub $7$ joined to every vertex of a $6$-cycle $1,2,3,4,5,6,1$. Find the maximum number of pairwise internally-disjoint paths between the two ADJACENT rim vertices $1$ and $2$.