Asymptotic corank growth conjecture for chromatic roots
For a finite graph , let be its chromatic polynomial and define
Let be the maximum of over graphs of corank .
Asymptotic corank-growth conjecture. As ,
This is presented as an expected consequence of the corrected fixed-corank extremal conjecture. The paper establishes matching lower bounds of this order from generalized theta graphs and an upper bound , but does not determine the asymptotic growth exactly.
References
- Jason Brown, Carl Hickman, Alan D. Sokal and David G. Wagner, “On the chromatic roots of generalized theta graphs”, arXiv:math/0012033 (2000).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.