The Library
On a lower bound for the connectivity of the independence complex of a graph
Tools
Tools
Tools
Adamaszek, Michał and Barmak, Jonathan Ariel. (2011) On a lower bound for the connectivity of the independence complex of a graph. Discrete Mathematics, Vol.311 (No.21). pp. 2566-2569. ISSN 0012-365X
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.disc.2011.06.010
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. (C) 2011 Elsevier B.V. All rights reserved.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science > Mathematics |
| Journal or Publication Title: | Discrete Mathematics |
| Publisher: | Elsevier BV |
| ISSN: | 0012-365X |
| Date: | 2011 |
| Volume: | Vol.311 |
| Number: | No.21 |
| Number of Pages: | 4 |
| Page Range: | pp. 2566-2569 |
| Identification Number: | 10.1016/j.disc.2011.06.010 |
| Status: | Peer Reviewed |
| Publication Status: | Published |
| Access rights to Published version: | Restricted or Subscription Access |
| Funder: | Centre for Discrete Mathematics and its Applications (DIMAP), EPSRC , Knut and Alice Wallenberg Foundation |
| Grant number: | EP/D063191/1 (EPSRC), KAW 2005.0098 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/39557 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
