Symmetric Graphs have symmetric Matchings
classification
🧮 math.GR
keywords
graphmatchingperfecttheresymmetricfactorgroupaction
read the original abstract
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for amenable groups: if there is a perfect matching on the graph, there is also a perfect matching on the factor graph, i. e. a group invariant ("symmetric") perfect matching on the graph.
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.