Definitions:

A cut (S, V-S) of an undirected graph G = (V, E) is a partition of V.

An edge (u,v) $\in$ E crosses the cut (S, V-S) if u $\in$ S and v $\in$ V-S.

(a,b) and (b,d) cross the cut