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

DOI10.1016/j.jctb.2006.02.011zbMath1119.05105arXivmath/0309331OpenAlexW1976154174MaRDI QIDQ859616

Matthias Beck, Thomas Zaslavsky

Publication date: 16 January 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0309331

zbMATH Keywords

arrangement of hyperplanesTutte polynomialsigned graphnowhere-zero flowbidirected graphintegral flow polynomiallattice-point countingrational convex polytope

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Graph theory (05C99) Oriented matroids in discrete geometry (52C40) Signed and weighted graphs (05C22)

Related Items

Many faces of symmetric edge polytopes, Orientations, lattice polytopes, and group arrangements. II: Modular and integral flow polynomials of graphs, Dualities and reciprocities on graphs on surfaces, Multiple weak 2-linkage and its applications on integer flows of signed graphs, A note on counting flows in signed graphs, A Tutte polynomial for non-orientable maps, Bounds on the coefficients of tension and flow polynomials, Hypergraph coloring complexes, Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of Tutte polynomial at positive integers, Tutte's dichromate for signed graphs, Nowhere-harmonic colorings of graphs, Ehrhart theory, modular flow reciprocity, and the Tutte polynomial, Orbit-counting polynomials for graphs and codes, Orientations, lattice polytopes, and group arrangements. III: Cartesian product arrangements and applications to Tutte type polynomials, Nowhere-zero \(\vec{k}\)-flows on graphs, On some polynomials enumerating fully packed loop configurations, Inside-out polytopes, The flow and tension spaces and lattices of signed graphs, Bounds of characteristic polynomials of regular matroids, Conformal decomposition of integral flows on signed graphs with outer-edges, A note on flow polynomials of graphs, Flow polynomials of a signed graph, Enumerating colorings, tensions and flows in cell complexes, Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nowhere-zero integral flows on a bidirected graph
• Nowhere-zero integral chains and flows in bidirected graphs
• Subspaces with well-scaled frames
• Signed graph coloring
• Erratum to: T. Zaslavsky, signed graphs
• Orientation of signed graphs
• Polynômes arithmétiques et méthode des polyedres en combinatoire
• Biased graphs IV: Geometrical realizations
• Counting integer flows in networks
• Polynomials associated with nowhere-zero flows
• Orbit-counting polynomials for graphs and codes
• Inside-out polytopes
• Acyclic orientations of graphs
• On the notion of balance of a signed graph
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Computing the Continuous Discretely
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Lectures on Polytopes
• A bidirected generalization of network matrices
• A simple algorithm that proves half‐integrality of bidirected network programming
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• On the Imbedding of Linear Graphs in Surfaces
• A Contribution to the Theory of Chromatic Polynomials