Answers are grounded in this paper and cite their sources.
For a graph G with nonnegative edge weights, let mc(G,w) denote the maximum total weight of a cut and let $w(G)$ denote the total edge weight. We prove that every edge-weighted triangle-free subcubic graph satisfies mc(G,w)≥ 15/19w(G), improving the bound of 8/11 due to Gutin and Yeo. For subcubic graphs of odd girth at least seven and nine, we strengthen this bound to 47/59w(G) and 45w(G), respectively, establishing the conjecture of Gutin and Yeo for graphs of odd girth at least nine. Our proofs combine structural properties of vertex partitions with randomized cut constructions and convex combinations of the resulting bounds.
No takes yet. Share an insight, caveat, or question.
Will Hausmann (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: