With every matching in a graph we associate a group called the matching group. We study this group using the theory of nonpositively curved cubed complexes. Our approach is formulated in terms of the so-called gliding systems.
科研之友
微信
新浪微博
Facebook
分享链接
