OurBigBook About$ Donate
 Sign in Sign up

Chromatic polynomial of a cycle (pCℓ​​(x)=(x−1)ℓ+(−1)ℓ(x−1))

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Graph coloring Chromatic polynomial
2026-10-25  0 By others on same topic  0 Discussions Create my own version
For a cycle graph of length ℓ≥3, the chromatic polynomial is pCℓ​​(x)=(x−1)ℓ+(−1)ℓ(x−1). The graph triangle gives the base case x(x−1)(x−2). For ℓ≥4, the deletion-contraction recurrence for the chromatic polynomial gives pCℓ​​(x)=x(x−1)ℓ−1−pCℓ−1​​(x), since deleting an edge leaves a path graph and contracting it gives the shorter cycle graph. Substitution proves the formula by mathematical induction.

 Ancestors (7)

  1. Chromatic polynomial
  2. Graph coloring
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Chromatic polynomial of a unicyclic graph
  • Past exam of the graph theory course of the University of Oxford / 2023 / 2 / 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