Additive bases and flows in graphs

From MaRDI portal




Abstract: It was conjectured by Jaeger, Linial, Payan, and Tarsi in 1992 that for any prime number p, there is a constant c such that for any n, the union (with repetition) of the vectors of any family of c linear bases of mathbbZpn forms an additive basis of mathbbZpn (i.e. any element of mathbbZpn can be expressed as the sum of a subset of these vectors). In this note, we prove this conjecture when each vector contains at most two non-zero entries. As an application, we prove several results on flows in highly edge-connected graphs, extending known results. For instance, assume that pge3 is a prime number and vecG is a directed, highly edge-connected graph in which each arc is given a list of two distinct values in mathbbZp. Then vecG has a mathbbZp-flow in which each arc is assigned a value of its own list.









This page was built for publication: Additive bases and flows in graphs

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