A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Node-balancing by edge-increments
[article]
2015
arXiv
pre-print
Suppose you are given a graph G=(V,E) with a weight assignment w:V→Z and that your objective is to modify w using legal steps such that all vertices will have the same weight, where in each legal step you are allowed to choose an edge and increment the weights of its end points by 1. In this paper we study several variants of this problem for graphs and hypergraphs. On the combinatorial side we show connections with fundamental results from matching theory such as Hall's Theorem and Tutte's
arXiv:1504.06919v2
fatcat:swizjw2kp5g7vlscqzryv3hx6y