Edge-connectivity and pairwise disjoint perfect matchings in regular graphs

Yulai Ma, Davide Mattiolo, Eckhard Steffen +1

For $0\le t\le r$ let $m(t,r)$ be the maximum number $s$ such that every $t$-edge-connected $r$-graph has $s$ pairwise disjoint perfect matchings. There are only a few values o…