Abstract
For each finite simple graph , Aharoni, Berger and Ziv consider a recursively defined number which gives a lower bound for the topological connectivity of the independence complex . They conjecture that this bound is optimal for every graph. We use a result of recursion theory to give a short disproof of this claim.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.