Submodular decompositions: a bounded-variation counterexample and an exact planar cut formula

Guoqing Wang; Linlin Wang; Jun Yue

Home/Archive/arXiv

arXiv · 2610.40032

Submodular decompositions: a bounded-variation counterexample and an exact planar cut formula

Guoqing Wang·Linlin Wang·Jun Yue

View original source ↗Read source document ↗Export metadata ↓

Abstract

Bérczi, Gehér, Imolay, Lovász, and Schwarcz (SIAM J. Discrete Math. 40(2026), 308--335) asked whether every set function of bounded variation is a difference of two bounded submodular functions, and how to determine the optimum in a monotonic sum-decomposition of a planar graph cut function. In this paper, we answer both questions and obtain quantitative extensions. For the first question, we characterize the continuous profiles $f:[0,1]\to\R$ for which $A\mapsto f(m(A))$ is a bounded submodular difference on an atomless probability space. More precisely, we express the minimum oscillation of the subtracted component through the positive part of the distributional second derivative. We also characterize admissible discontinuous profiles and give an exact summability criterion for countable block functions. In particular, the first question has a negative answer even for increasing functions of variation one whose scalar profiles have log-Lipschitz derivatives and belong to every $C^{1,α}$, $0<α<1$. Turning to graph cuts, we prove that the optimum equals the total edge weight minus the maximum fractional triangle-packing weight for every nonnegative weighting if and only if the graph is $K_5$-free. Moreover, maximum packings parametrize the symmetrized optimal components, while on $K_4$-free graphs we describe all optimal components and characterize uniqueness. Consequently, the formula applies to weighted planar graphs and implies edge-weight monotonicity on $K_5$-free graphs. For rational weights, it also yields polynomial-time constructions.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Guoqing Wang, Linlin Wang, Jun Yue. 2026-10-29. Submodular decompositions: a bounded-variation counterexample and an exact planar cut formula. https://arxiv.org/abs/2610.40032

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How to Tropicalize a non-Archimedean Lattice

We present a method for computing the tropicalization of a lattice over the valuation ring of a non-Archimedean field. Our construction relies on the entropy polynomial, a tropical polynomial whose coefficients are determined by the valuations of minors of a matrix representing the lattice. We show that the tropicalization of the lattice is the support of a polyhedral complex defined through this polynomial. Moreover, we prove that this tropicalization is a finitely generated tropical semimodule over the nonnegative tropical scalars and provide explicit generators in terms of the entropy vector of the lattice. Finally, we extend our construction to valuated bimatroids, establishing analogous results beyond the realizable setting.

math.CO↗

arXiv2026

Arboreal Networks and Ultrametrics

Ultrametrics are an important class of distances used in applications such as phylogenetics, clustering and classification theory. Ultrametrics are essentially distances that can be represented by an edge-weighted rooted tree so that all of the distances in the tree from the root to any leaf of the tree are equal. In this paper, we introduce a generalization of ultrametrics called arboreal ultrametrics which have applications in phylogenetics and also arise in the theory of distance-hereditary graphs. These are partial distances, that is distances that are not necessarily defined for every pair of elements in the groundset, that can be represented by an ultrametric arboreal network, that is, an edge-weighted rooted network whose underlying graph is a tree. As with ultrametrics all of the distances in the ultrametric arboreal network from any root to any leaf below it are are equal but, in contrast, the network may have more than one root. In our two main results we characterize when a partial distance is an arboreal ultrametric as well as proving that, somewhat surprisingly, given any unrooted edge-weighted phylogenetic tree there is a necessarily unique way to insert roots into this tree so as to obtain an arboreal ultrametric.

math.CO↗

arXiv2026

Coloring t-perfect graphs with fewer colors

Recently, Chudnovsky, Cook, Davies, Oum, and Tan obtained the first finite bound on the chromatic number of t-perfect graphs, showing that they are 199053-colorable. We improve this bound to 130 by refining their proof. The original proof establishes that every graph with large odd girth and large chromatic number contains a certain structure called an r-arithmetic rope, and that its existence in a certain leveling of a graph with large odd girth would imply an odd wheel as a t-minor, a known obstruction to t-perfectness. While their technique requires a lower bound on the chromatic number that is exponential in r, we show that the existence of an r-arithmetic rope can already be guaranteed under a linear bound. Using a slightly weakened notion of arithmetic ropes allows us to reduce the bound even further.

math.CO↗