Abstract

Close upper and lower bounds on the linear discrepancy of incidence matrices of directed graphs are determined. For such matrices this improves on a bound found in the work of Doerr [Linear discrepancy of basic totally unimodular matrices, The Electronic Journal of Combinatorics, 7:Research Paper 48, 4 pp., 2000].

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call