An -graph is an -regular graph in which every odd set of vertices is connected to its complement by at least edges. A central question regarding -graphs is determining the maximum number of pairwise disjoint perfect matchings they can contain. This talk explores how edge connectivity influences this parameter. For ${0 \leq \lambda \leq …
