A zero-free interval for flow polynomials of cubic graphs

Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞,γ) are 0, 1 and 2, where γ ≈ 2.54... is the zero in (2,3) of the chromatic polynomial of the octahedron. The main purpose of this paper is to remove the planarity hypothesis from Woodall’s theorem by showing that the dual statement holds for both planar and nonplanar graphs: if G is a cubic bridgeless graph, then the only zeros of F(G,t) in (−∞,γ) are 1 and 2, where γ ≈ 2.54... is the zero in (2,3) of the flow polynomial of the cube. Our inductive proof technique forces us to work with near-cubic graphs, that is to say graphs with minimum degree at least two and at most one vertex of degree greater then three. We also obtain related results concerning the zero distribution of the flow polynomials of near-cubic graphs.

• Type: Journal
• Year: 2007
• Where: JCT
• Authors: Bill Jackson
• Keywords: Graph G, JCT 2007, Plane Triangulation, flow Polynomials