On the Number of Small Cuts in a Graph

  • Authors:

  • Monika R Henzinger;David Williamson

  • Affiliations:

  • -;-

  • Venue:
  • On the Number of Small Cuts in a Graph
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove that in an undirected graph there are at most $O(n^2)$ cuts of size strictly less than $\frac{3}{2}$ the size of the minimum cut.