![](/files/happy5.png)
Half-integral flow polynomial values
Let be the flow polynomial of a graph
. So for every positive integer
, the value
equals the number of nowhere-zero
-flows in
.
Conjecture
for every 2-edge-connected graph
.
![$ \Phi(G,5.5) > 0 $](/files/tex/f92ea960643014765c1c0ed65e6c4c4c4533503c.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
By Seymour's 6-flow theorem, for every 2-edge-connected graph
and every integer
.
It would be interesting to find any non-integer rational number so that
for every 2-edge-connected graph
. It is known that zeros of flow polynomials are dense in the complex plane.
Bibliography
* indicates original appearance(s) of problem.