Nowhere-zero k-flows on graphs

From MaRDI portal
Publication:2256973



Abstract: We introduce and study a multivariate function that counts nowhere-zero flows on a graph G, in which each edge of G has an individual capacity. We prove that the associated counting function is a piecewise-defined polynomial in these capacities, which satisfy a combinatorial reciprocity law that incorporates totally cyclic orientations of G.












This page was built for publication: Nowhere-zero \(\vec{k}\)-flows on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256973)