Zero-sum 6-flows in 5-regular graphs
Combinatorics
2016-01-29 v1
Abstract
Let be a graph. A zero-sum flow of is an assignment of non-zero real numbers to the edges of such that the sum of the values of all edges incident with each vertex is zero. Let be a natural number. A zero-sum -flow is a flow with values from the set . In this paper, we prove that every 5-regular graph admits a zero-sum 6-flow.
Keywords
Cite
@article{arxiv.1601.07813,
title = {Zero-sum 6-flows in 5-regular graphs},
author = {Fan Yang and Xiangwen Li},
journal= {arXiv preprint arXiv:1601.07813},
year = {2016}
}
Comments
arXiv admin note: text overlap with arXiv:1108.2950 by other authors