Kalai–Meshulam total Betti number conjecture for independence complexes
Statement
Let be a graph. Its independence complex is the simplicial complex whose faces are the independent sets of , and let denote its total Betti number. For every induced subgraph of , consider .
Kalai–Meshulam total Betti number conjecture. For any graph , we have
for every induced subgraph of if and only if there are no induced cycles of length divisible by three in .
The source states that this conjecture remains open. It is a stronger topological analogue of the reduced Euler characteristic conjecture.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.