Abstract
In this paper we study a 2-color analog of the cycle cone of a graph. Suppose the edges of a graph are colored red and blue. A nonnegative real vector on the edges is said to be balanced if the red sum equals the blue sum at every vertex. A balanced subgraph is a subgraph whose characteristic vector is balanced (i.e., red degree equals blue degree at every vertex). By a sum (respectively, fractional sum) of cycles we mean a nonnegative integral (respectively, nonnegative rational) combination of characteristic vectors of cycles. Similarly, we define sum and fractional sum of balanced subgraphs. We show that a balanced sum of cycles is a fractional sum of balanced subgraphs.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
