Theta-graph extremal conjecture for chromatic roots at fixed corank

At least 25 years old · documented by

Let GG be a finite graph of corank kk, and let

ρ(G)=max⁡{∣z−1∣:π(G,z)=0}.\rho(G)=\max\{|z-1|:\pi(G,z)=0\}.

For k≥1k\geq 1, write ρk\rho_k for the maximum of ρ(G)\rho(G) over graphs of corank kk, and let ρ(2,k+1)\rho^{(2,k+1)} denote the corresponding value for the (k+1)(k+1)-ary generalized theta graph Θ(2,k+1)\Theta^{(2,k+1)}.

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

ρ(G)≤ρ(2,k+1).\rho(G)\leq \rho^{(2,k+1)}.

In particular, for k≥4k\geq 4,

ρk=ρ(2,k+1).\rho_k=\rho^{(2,k+1)}.

The originally proposed statement without the exception G=K4G=K_4 is refuted: K4K_4 has corank 33 and a chromatic root at z=3z=3, whereas ρ(2,4)≈1.9636\rho^{(2,4)}\approx 1.9636. The corrected conjecture remains open in the supplied source.

References

Primary source

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.