Independence complexes of claw-free graphs
| dc.creator | Engström, Alexander | |
| dc.date | 2005-12-17 | |
| dc.date.accessioned | 2026-07-07T06:55:28Z | |
| dc.date.available | 2026-07-07T06:55:28Z | |
| dc.description | We study the class of independence complexes of claw-free graphs. The main theorem give good bounds on the connectivity of these complexes, given bounds for a few subcomplexes of the same class. Two applications are presented. Firstly, we show that the independence complex of a claw-free graph with n vertices and maximal degree d is (cn/d+epsilon)-connected, where c=2/3. This can be compared with the result of Szabo and Tardos that c=1/2 is optimal with no restrictions on the graphs. Secondly, we calculate the connectivity of a family of complexes used in Babson and Kozlov's proof of Lovasz conjecture. | |
| dc.description | 8 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0512420 | |
| dc.identifier | http://arxiv.org/abs/math/0512420 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106289 | |
| dc.subject | Combinatorics | |
| dc.subject | 57M15, 05C15 | |
| dc.title | Independence complexes of claw-free graphs | |
| dc.type | text |