Chromatic Bounds on Orbital Chromatic Roots
- Creators
- Kim, Dae Hyun
- Mun, Alexander H.
- Omar, Mohamed
Abstract
Given a group G of automorphisms of a graph Γ, the orbital chromatic polynomial OPΓ,G(x) is the polynomial whose value at a positive integer k is the number of orbits of G on proper k-colorings of Γ. Cameron and Kayibi introduced this polynomial as a means of understanding roots of chromatic polynomials. In this light, they posed a problem asking whether the real roots of the orbital chromatic polynomial of any graph are bounded above by the largest real root of its chromatic polynomial. We resolve this problem in a resounding negative by not only constructing a counterexample, but by providing a process for generating families of counterexamples. We additionally begin the program of finding classes of graphs whose orbital chromatic polynomials have real roots bounded above by the largest real root of their chromatic polynomials; in particular establishing this for many outerplanar graphs.
Additional Information
© 2014 The Authors. Submitted: May 30, 2014; Accepted: Oct 10, 2014; Published: Oct 23, 2014. The authors express sincere thanks to the anonymous referees for providing a number of helpful suggestions to improve the presentation of this paper. Supported by Summer Undergraduate Research Fellowships at the California Institute of Technology.Attached Files
Published - Kim_2014p4.17.pdf
Files
Name | Size | Download all |
---|---|---|
md5:e89722a38dd3fcd2220cb9ac2cc2fb05
|
281.3 kB | Preview Download |
Additional details
- Eprint ID
- 52209
- Resolver ID
- CaltechAUTHORS:20141201-101314782
- Summer Undergraduate Research Fellowship (SURF), Caltech
- Created
-
2014-12-02Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field