Yulai Ma, Pairwise disjoint perfect matchings in regular graphs
Yulai Ma, Pairwise disjoint perfect matchings in regular graphs
An
A major goal of additive combinatorics is to understand the structures of subsets A of an abelian group G which has a small doubling K = |A+A|/|A|. Freiman's celebrated theorem first provided a structural characterization of sets with small doubling over the integers, and subsequently Ruzsa in 1999 proved an analog for abelian groups with …