Abstract:The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four form a laminar family. Such hypergraphs have been used to model problems with fairness constraints that ensure balanced representation, among other applications. Our main result shows that total unimodularity for laminar hypergraphs is equivalent to forbidding odd cycles and structures that we call avocados and tree houses. As a corollary, we resolve a special case of a conjecture on almost totally unimodular matrices, originally posed by Padberg and later modified by Cornuéjols and Zuluaga. We discuss applications of laminar hypergraphs and connect our results to integer programming with bounded subdeterminants.
From: Meike Neuwohner [view email]
[v1]
Fri, 15 Nov 2024 21:31:36 UTC (48 KB)
[v2]
Mon, 25 Aug 2025 11:05:49 UTC (39 KB)
[v3]
Sun, 13 Sep 2026 18:58:26 UTC (55 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。