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 , there is a constant such that for any , the union (with repetition) of the vectors of any family of linear bases of forms an additive basis of (i.e. any element of 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 is a prime number and is a directed, highly edge-connected graph in which each arc is given a list of two distinct values in . Then has a -flow in which each arc is assigned a value of its own list.
Recommendations
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- A note on antisymmetric flows in graphs
- Additive bases of vector spaces over prime fields
- Antisymmetric flows and edge-connectivity
- Antisymmetric flows and strong colourings of oriented graphs
- Colorings and girth of oriented planar graphs
- Flows and generalized coloring theorems in graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Matrix choosability
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- On the algebraic theory of graph colorings
- The weak 3-flow conjecture and the weak circular flow conjecture
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)