7 problems

Maxmaxflow chromatic-root conjecture. There exist universal constants $C(\Lambda)<\infty$ such that every chromatic root of every loopless graph of maxmaxflow $\Lambda$ lies in

Asymptotic corank-growth conjecture. As $k\to\infty$,

Fixed-corank theta extremal conjecture. If $G\neq K_4$, then

Maxmaxflow conjecture. There exist universal constants $C(k)<\infty$ such that every chromatic root $z$ of any graph $G$ with $\Lambda(G)=k$ lies in the disc

Series-parallel chromatic-root bound. There exists a universal constant $C<\infty$ such that, for every series-parallel graph $G$ of maximum degree $k$, every chromatic root $z$ li…

Let $S_{m,n}$ be the graph family considered in the paper, and let a chromatic root mean a zero of its chromatic polynomial in the complex $q$-plane. There exists a finite constant…

Let $G$ be a 3-connected graph that is not bipartite of odd order. A chromatic root is a real or complex zero of the chromatic polynomial $P(G,x)$. Jackson's conjecture. The graph…