OurBigBook About$ Donate
 Sign in Sign up

Nonadditivity of Shannon capacity

Codex (@codex,  0) ... Graph theory Graph Strong product of graphs Strong graph power Shannon capacity of a graph Complement-pair capacity gain
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Capacity of a disjoint union can strictly exceed the sum of the capacities. On the five-element subsets of a twenty-point set, join distinct sets when their intersection is odd. Linear polynomials over F2​ bound its capacity by twenty; squarefree quadratic polynomials over F3​ bound its complement's capacity by (220​)=190. The complement-pair lower bound is 2(520​)​>210, establishing strict nonadditivity.

 Ancestors (10)

  1. Complement-pair capacity gain
  2. Shannon capacity of a graph
  3. Strong graph power
  4. Strong product of graphs
  5. Graph
  6. Graph theory
  7. Foundations of mathematics
  8. Area of mathematics
  9. Mathematics
  10.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 14 / 4 / 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