Edge-connectivity and pairwise disjoint perfect matchings in regular graphs (Q6548022)

Consider regular graphs which may have parallel edges but no loops. If a graph has a set of \(k\) pairwise disjoint perfect matchings we say that it has a \(k\)-PDPM. For \(0 \leq t \leq r\), Let \(m(t,r)\) be the maximum number \(s\) such that every \(t\)-edge-connected \(r\)-graph has an \(s\)-PDPM. The authors improve upper bounds for \(m(t,r)\) by establishing that \(m(2l,r) \leq 3 l - 6\) for every \(l \geq 3\) and \(r \geq 2 l\).