Flows and Connectivity · Flow Polynomial (Optional)

Lesson 6

Nikolai Chukhin · Alexander S. Kulikov

The cut lemma has an immediate consequence for bridges.

Problem. Let \(e\) be a bridge of an undirected graph \(G\), and let \(\phi\) be any \(\Gamma\)-circulation on \(G\). What is the value of \(\phi(e)\)?

1 point