Matching groups and gliding systems
Combinatorics
2015-06-18 v1
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.
Cite
@article{arxiv.1401.3282,
title = {Matching groups and gliding systems},
author = {Vladimir Turaev},
journal= {arXiv preprint arXiv:1401.3282},
year = {2015}
}
Comments
24 pages, 1 figure. This paper generalizes and replaces my paper on dimer spaces, arXiv:1211.3975