Matching groups and gliding systems
classification
🧮 math.CO
keywords
groupmatchingglidingsystemsapproachassociatecalledcomplexes
read the original abstract
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
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.