INVESTIGADORES
BARMAK jonathan Ariel
artículos
Título:
On a lower bound for the connectivity of the independence complex of a graph
Autor/es:
MICHAL ADAMASZEK; JONATHAN ARIEL BARMAK
Revista:
DISCRETE MATHEMATICS
Editorial:
ELSEVIER SCIENCE BV
Referencias:
Lugar: Amsterdam; Año: 2011 vol. 311 p. 2566 - 2569
ISSN:
0012-365X
Resumen:
Aharoni, Berger and Ziv proposed a function which is a lower bound for the connectivity of the independence complex of a graph. They conjectured that this bound is optimal for every graph. We give two different arguments which show that the conjecture is false.
