Given an undirected graph and two vertices and , if the minimum number of edges connecting and is greater than (where ), show there exists a node such that all - paths contain .

I'm not sure how to get started but something tells me to use breadth first search and apply the pigeon hole principle.

Any help is appreciated! Thanks!