OurBigBook About$ Donate
 Sign in Sign up

Component-band vertex count (N[k,ℓ)​(G)=∑C:k≤∣C∣<ℓ​∣C∣)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Random graph Achlioptas process
2026-10-07  0 By others on same topic  0 Discussions Create my own version
This is the total number of vertices in graph components with orders in the specified half-open interval. It differs from the number of those graph components. Write N≥k​ for the total above the lower endpoint. Then N[k,ℓ)​=N≥k​−N≥ℓ​. Disjoint size bands count disjoint sets of vertices at a common time, even though their mass may move between bands as an Achlioptas process adds edges.

 Ancestors (7)

  1. Achlioptas process
  2. Random 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 / 2012 / iii / Paper 9 / 5 / i / 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