Finiteness conjecture for cyclically 4-connected cubic flow roots

From papers

Let GG be a cyclically 4-connected cubic graph, and let F(G,t)F(G,t) denote its flow polynomial. Let τ=(1+5)/2\tau=(1+\sqrt{5})/2. Finiteness conjecture. For every ϵ>0\epsilon>0, only finitely many cyclically 4-connected cubic graphs have a flow root in

(2,τ2ϵ).(2,\tau^2-\epsilon).

This is the flow-polynomial counterpart of the finiteness conjecture for 4-connected plane triangulations. The source presents it as open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Bill Jackson, “Zeros of Chromatic and Flow Polynomials of Graphs”, arXiv:math/0205047 (2002).

Solutions 0

No solutions have been posted yet.