On a lower bound for the connectivity of the independence complex of a graph |
| |
| Authors: | Micha? Adamaszek Jonathan Ariel Barmak |
| |
| Affiliation: | aWarwick Mathematics Institute and DIMAP, University of Warwick, Coventry, CV4 7AL, UK;bMathematics Department, Kungliga Tekniska Högskolan, Stockholm, Sweden |
| |
| Abstract: | 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. |
| |
| Keywords: | Independence complex Topological connectivity |
| 本文献已被 ScienceDirect 等数据库收录！ |
