OurBigBook About$ Donate
 Sign in Sign up

Balanced random cut lower bound

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Cut of a graph Random cut lower bound
2026-10-03  0 By others on same topic  0 Discussions Create my own version
If a graph has even order n and m edges, it has a cut with equally sized parts and at least
2(n−1)mn​
(1)
crossing edges. Choose one part uniformly among the n/2-vertex subsets. A fixed edge is separated with probability
2nn/2​n−1n/2​=2(n−1)n​,
(2)
and apply linearity of expectation.

 Ancestors (7)

  1. Random cut lower bound
  2. Cut of a graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 3 / 17G / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook