Independence complexes of claw-free graphs

Details Independence complexes of claw-free graphs Independence complexes of claw-free graphs

2005-12-17

arxiv.org/abs/math/0512420v1

Mathematics

Combinatorics

8 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Independence complexes of claw-free graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Independence complexes of claw-free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Independence complexes of claw-free graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-133491