Using path-congestion arguments and graph expansion, we prove forn the pair crossing number slightly weaker analogies of theorems known for the crossing number.
