The word problem and the Aharoni-Berger-Ziv conjecture on the connectivity of independence complexes

preprint2010arXivOpen access

Abstract

For each finite simple graph GG, Aharoni, Berger and Ziv consider a recursively defined number ψ(G)∈Z∪{+∞}ψ(G) \in \mathbb{Z}\cup \{+ \infty \} which gives a lower bound for the topological connectivity of the independence complex IGI_G. 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.