The number of nowhere-zero flows on graphs and signed graphs

A nowhere-zero k-flow on a graph @C is a mapping from the edges of @C to the set {+/-1,+/-2,...,+/-(k-1)}@?Z such that, in any fixed orientation of @C, at each node the sum of the labels over the edges pointing towards the node equals the sum over the edges pointing away from the node. We show that the existence of an integral flow polynomial that counts nowhere-zero k-flows on a graph, due to Kochol, is a consequence of a general theory of inside-out polytopes. The same holds for flows on signed graphs. We develop these theories, as well as the related counting theory of nowhere-zero flows on a signed graph with values in an abelian group of odd order. Our results are of two kinds: polynomiality or quasipolynomiality of the flow counting functions, and reciprocity laws that interpret the evaluations of the flow polynomials at negative integers in terms of the combinatorics of the graph.

[1]  William T. Tutte,et al.  Selected Papers Of W.T. Tutte , 1979 .

[2]  Martin Kochol,et al.  Polynomials Associated with Nowhere-Zero Flows , 2002, J. Comb. Theory, Ser. B.

[3]  Thomas Zaslavsky,et al.  A simple algorithm that proves half-integrality of bidirected network programming , 2006 .

[4]  W. T. Tutte,et al.  A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.

[5]  A. Khelladi,et al.  Nowhere-zero integral chains and flows in bidirected graphs , 1987, J. Comb. Theory, Ser. B.

[6]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[7]  Jon Lee,et al.  Subspaces with well-scaled frames , 1989 .

[8]  Thomas Zaslavsky,et al.  Biased graphs IV: Geometrical realizations , 2003, J. Comb. Theory, Ser. B.

[9]  Richard P. Stanley.  Acyclic orientations of graphs , 1973, Discret. Math..

[10]  Thomas Zaslavsky,et al.  Signed graph coloring , 1982, Discret. Math..

[11]  Thomas Zaslavsky,et al.  Inside-out polytopes , 2003, math/0309330.

[12]  W. T. Tutte.  Graph Theory , 1984 .

[13]  Thomas Zaslavsky.  Orientation of Signed Graphs , 1991, Eur. J. Comb..

[14]  G. Rota.  On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[15]  E. Ehrhart,et al.  Polynômes arithmétiques et méthode des polyèdres en combinatoire , 1974 .

[16]  H. Whitney.  A Theorem on Graphs , 1931 .

[17]  H. Robbins.  A Theorem on Graphs, with an Application to a Problem of Traffic Control , 1939 .

[18]  Jesús A. De Loera,et al.  Counting Integer Flows in Networks , 2003, Found. Comput. Math..

[19]  F. Harary.  On the notion of balance of a signed graph. , 1953 .

[20]  W. T. Tutte,et al.  On the Imbedding of Linear Graphs in Surfaces , 1949 .

[21]  Thomas Zaslavsky,et al.  ON THE INTERPRETATION OF WHITNEY NUMBERS THROUGH ARRANGEMENTS OF HYPERPLANES, ZONOTOPES, NON-RADON PARTITIONS, AND ORIENTATIONS OF GRAPHS , 1983 .

[22]  T. Zaslavsky.  Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[23]  Thomas Zaslavsky.  Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74 , 1983, Discret. Appl. Math..

[24]  Tom Brylawski,et al.  Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .

[25]  Paul Seymour,et al.  Nowhere-zero flows , 1996 .

[26]  S. Robins,et al.  Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra , 2007 .

[27]  James G. Oxley,et al.  Matroid theory , 1992 .

[28]  Thomas Zaslavsky,et al.  A simple algorithm that proves half-integrality of bidirected network programming , 2006, Networks.

[29]  André Bouchet,et al.  Nowhere-zero integral flows on a bidirected graph , 1983, J. Comb. Theory B.

[30]  Balázs Kotnyek,et al.  A bidirected generalization of network matrices , 2006, Networks.

[31]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[32]  William T. Tutte.  A Ring in Graph Theory , 1947 .

[33]  Bill Jackson,et al.  Orbit-counting polynomials for graphs and codes , 2008, Discret. Math..

[34]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[35]  G. Ziegler.  Lectures on Polytopes , 1994 .