Beraha's Conjecture and Cyclic Graphs

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The chromatic polynomial of a graph gives the number of ways to color the graph with colors, such that no pair of connected vertices shares the same color.


Beraha's conjecture (due to Tutte) says that for each , the Beraha number is the limit of roots of at least one family of chromatic polynomials.

This Demonstration shows that:

1) All cyclic graphs of odd order have a root of their chromatic polynomial equal to .

2) For even order , let be the root with largest real part and positive imaginary part, and let be the complex conjugate root (the chromatic polynomial has real coefficients so complex roots come in conjugate pairs). Then the sequences and converge to as .


Contributed by: Jacqueline Zizi (March 2011)
Open content licensed under CC BY-NC-SA



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.