Finiteness conjecture for cyclically 4-connected cubic flow roots
Finiteness conjecture for cyclically 4-connected cubic flow roots
From papers
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.
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
Sign in to submit a solution.
No solutions have been posted yet.