On the imaginary parts of chromatic root

While much attention has been directed to the maximum modulus and maximum real part of chromatic roots of graphs of order $n$ (that is, with $n$ vertices), relatively little is known about the maximum imaginary part of such graphs. We prove that the maximum imaginary part can grow linearly in the order of the graph. We also show that for any fixed $p \in (0,1)$, almost every random graph $G$ in the Erd\"os-R\'enyi model has a non-real root.