Improved upper bounds: diameter of partition polytopes ≤ κ1+⌈κ2/2⌉, and path/cycle odd-covers of Eulerian graphs ≤ ⌈3Δ/4⌉.
The diameters of network-flow polytopes satisfy the Hirsch conjecture
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
Improved upper bounds: diameter of partition polytopes ≤ κ1+⌈κ2/2⌉, and path/cycle odd-covers of Eulerian graphs ≤ ⌈3Δ/4⌉.