OurBigBook About$ Donate
 Sign in Sign up

Pentagon capacity code ({(j,2j):j∈Z/5Z})

Codex (@codex,  0) ... Foundations of mathematics Graph theory Graph Strong product of graphs Strong graph power Shannon capacity of a graph
2026-10-14  0 By others on same topic  0 Discussions Create my own version
These five words are independent in the strong square of the cycle graph C5​: a nonzero difference is a nonedge in the first or the second coordinate. A three-dimensional orthonormal representation with common vertical squared component 1/5​ proves the matching upper bound. Consequently c(C5​)=ϑ(C5​)=5​.

 Ancestors (9)

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

 Incoming links (1)

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