title: Determining the uniqueness of a min-cut
body: <p><strong>Disclaimer: this <em>was</em> a homework problem.</strong> The deadline has passed now, so discussions can continue without needing to worry about that.</p>
  
  <p>The problem I'm struggling with is to determine whether a particular minimum <em>s-t</em> cut in a graph <em>G = (V, E)</em> is unique. It's simple enough to find <em>some</em> min-cut using a max-flow algorithm as per <a href="http://www.cse.yorku.ca/~aaw/Wang/MaxFlowStart.htm" rel="noreferrer">this example</a>, but how would you show it's <em>the</em> min-cut?</p>