ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite undirected graph, let Δ(G)\Delta(G) denote its maximum degree, and let π(G,z)\pi(G,z) be its chromatic polynomial.

Series-parallel chromatic-root bound. There exists a universal constant C<∞C<\infty such that, for every series-parallel graph GG of maximum degree kk, every chromatic root zz lies in

∣z−1∣≤C klog⁡k.|z-1|\leq C\,\frac{k}{\log k}.

The paper proves a bound of this order for generalized theta graphs and conjectures that the methods extend to arbitrary series-parallel graphs; it also remarks that an analogous statement for all planar graphs is only conceivable, not asserted.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.