Abstract
A graph is Helly if every family of pairwise intersecting combinatorial balls has a nonempty intersection. We show that weak Garside groups of finite ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
