# Equitable factorizations of edge-connected graphs

## TL;DR

This paper establishes conditions under which highly edge-connected graphs can be decomposed into factors with degrees close to a uniform distribution, with applications to parity and degree constraints.

## Contribution

It introduces new edge-decomposition theorems for highly edge-connected graphs with degree and parity constraints, extending previous results in graph factorization.

## Key findings

- Edge-connected graphs can be decomposed into factors with degrees close to uniform.
- Specific conditions allow for parity-preserving decompositions with degree bounds.
- A sufficient condition for parity factors with prescribed degree deviations is provided.

## Abstract

In this paper, we show that every $(3k-3)$-edge-connected graph $G$, under a certain condition on whose degrees, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$, $|d_{G_i}(v)-d_G(v)/k|< 1$, where $1\le i\le k$. As application, we deduce that every $6$-edge-connected graph $G$ can be edge-decomposed into three factors $G_1$, $G_2$, and $G_3$ such that for each vertex $v\in V(G_i)$, $|d_{G_i}(v)-d_{G}(v)/3|< 1$, unless $G$ has exactly one vertex $z$ with $d_G(z) \stackrel{3}{\not\equiv}0$. Next, we show that every odd-$(3k-2)$-edge-connected graph $G$ can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$, $d_{G_i}(v)$ and $d_G(v)$ have the same parity and $|d_{G_i}(v)-d_G(v)/k|< 2$, where $k$ is an odd positive integer and $1\le i\le k$. Finally, we give a sufficient edge-connectivity condition for a graph $G$ to have a parity factor $F$ with specified odd-degree vertices such that for each vertex $v$, $| d_{F}(v)-\varepsilon d_G(v)|< 2$, where $\varepsilon $ is a real number with $0< \varepsilon < 1$.