  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.
