搜索结果: 1-1 共查到“数理逻辑与数学基础 Word problem”相关记录1条 . 查询时间(0.11 秒)
The word problem and the Aharoni-Berger-Ziv conjecture on the connectivity of independence complexes
Graphs independence complexes topological connectivity algorithm
2010/12/9
For each finite simple graph G, Aharoni, Berger and Ziv consider a recur-sively defined number (G) 2 Z [ {+1} which gives a lower bound for the topological connectivity of the independence complex IG...