Let {G = (V,E),s,t V, {c_e} _{e E}} be a network and f* a maximum valid flow. An edge e E is called a bottleneck edge if increasing its capacity increases the size of the maximum flow f*.

True or False: every saturated edge (this is,f*(e) = c_e) in the network is a bottleneck edge.

- True

- False