Perfect Matchings as IID Factors on Non-Amenable Groups
classification
🧮 math.PR
math.COmath.DS
keywords
everyfactorsnon-amenableperfectbipartiteboundcayleydiscuss
read the original abstract
We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the Hoffman spectral bound on independence number of finite graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.