The homotopy type of the independence complex of graphs with no induced cycles of length divisible by 3

DOI10.1016/J.EJC.2022.103534zbMATH Open1492.05169arXiv2101.07131OpenAlexW4226225316MaRDI QIDQ2143403FDOQ2143403

Authors: Jinha Kim 

Publication date: 31 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We prove Engstr"{o}m's conjecture that the independence complex of graphs with no induced cycle of length divisible by $3$ is either contractible or homotopy equivalent to a sphere. Our result strengthens a result by Zhang and Wu, verifying a conjecture of Kalai and Meshulam which states that the total Betti number of the independence complex of such a graph is at most $1$. A weaker conjecture was proved earlier by Chudnovsky, Scott, Seymour, and Spirkl, who showed that in such a graph, the number of independent sets of even size minus the number of independent sets of odd size has values $0$, $1$, or $-1$.

Full work available at URL: https://arxiv.org/abs/2101.07131

Recommendations

• Proof of the Kalai-Meshulam conjecture
• On the homology of independence complexes
• Independence complexes of chordal graphs
• scientific article
• Higher independence complexes of graphs and their homotopy types

zbMATH Keywords

homotopy typeindependence complexternary graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Proof of the Kalai-Meshulam conjecture
• Complexes of directed trees

Cited In (2)

• Title not available (Why is that?)
• Proof of the Kalai-Meshulam conjecture

This page was built for publication: The homotopy type of the independence complex of graphs with no induced cycles of length divisible by 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143403)