  In a continuous-time quantum walk on a network of qubits, pretty good state
transfer is the phenomenon of state transfer between two vertices with fidelity
arbitrarily close to 1. We construct families of graphs to demonstrate that
there is no bound on the size of a set of vertices that admit pretty good state
transfer between any two vertices of the set.
