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 …
1 event found.