Improved Decomposition Bounds for Partition Polytopes and Odd-Covers

TL;DR

This paper presents improved upper bounds for the diameter of partition polytopes and the size of odd-covers in graphs, advancing understanding in combinatorial optimization and graph theory.

Contribution

It introduces tighter bounds on the diameter of partition polytopes and the size of cycle and path odd-covers for graphs, improving upon previous results.

Findings

Diameter of partition polytope at most eil(3K/2)eil(K= max cluster size)

Cycle and path odd-covers of Eulerian graphs with max degree eil(3elta/4)eil(Delta)

Both proofs leverage the linear arboricity of graphs with max degree 4

Abstract

The assignments of a set of $m$ items into $n$ clusters of prescribed sizes $k_1,\dots,k_n$ can be encoded as the vertices of the partition polytope $\mathrm{PP}(k_1,\dots,k_n)$. We prove that, if $K = \max\{k_1,\dots,k_n\}$, then the combinatorial diameter of $\mathrm{PP}(k_1,\dots,k_n)$ is at most $\lceil 3K/2\rceil$. This improves the previously known upper bound of $2K$. A cycle (or path) odd-cover of a graph $G$ is a set of cycles (or paths) with symmetric difference $G$. We prove that every Eulerian graph $G$ with maximum degree $\Delta$ admits a cycle odd-cover and a path odd-cover, each of size at most $\lceil 3\Delta/4\rceil$. This improves the previously known upper bound of $\Delta$. The two proofs share many similarities and are both based on the proof of Akiyama, Exoo, and Harary that every graph with maximum degree 4 has linear arboricity at most 3.