搜索结果: 1-3 共查到“数理逻辑与数学基础 Independence”相关记录3条 . 查询时间(0.093 秒)
Nowhere dense graph classes, stability, and the independence property
Nowhere dense graph classes the independence property
2010/11/23
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorith...
Notes on factor-criticality, extendibility and independence number
Notes on factor-criticality independence number
2010/11/19
In this paper, we give a sufficient and necessary condition for a $k$-extendable graph to be $2k$-factor-critical when $k=\nu/4$, and prove some results on independence numbers in $n$-factor-critical ...
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...