Finiteness conjecture for cyclically 4-connected cubic flow roots
Let be a cyclically 4-connected cubic graph, and let denote its flow polynomial. Let . Finiteness conjecture. For every , only finitely many cyclically 4-connected cubic graphs have a flow root in
This is the flow-polynomial counterpart of the finiteness conjecture for 4-connected plane triangulations. The source presents it as open.
References
Primary source
Bill Jackson, “Zeros of Chromatic and Flow Polynomials of Graphs”, arXiv:math/0205047 (2002).
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.