Invariant random matchings in Cayley graphs

Endre Csoka, Gabor Lippner

We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching.…