-
Yulai Ma, Pairwise disjoint perfect matchings in regular graphs
Yulai Ma, Pairwise disjoint perfect matchings in regular graphs
An $r$-graph is an $r$-regular graph in which every odd set of vertices is connected to its complement by at least $r$ edges. A central question regarding $r$-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 …