ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. Its independence complex Ind(G)\mathrm{Ind}(G) is the simplicial complex whose faces are the independent sets of GG, and let β\beta denote its total Betti number. For every induced subgraph HH of GG, consider β(Ind(H))\beta(\mathrm{Ind}(H)).

Kalai–Meshulam total Betti number conjecture. For any graph GG, we have

β(Ind(H))≤1\beta(\mathrm{Ind}(H)) \leq 1

for every induced subgraph HH of GG if and only if there are no induced cycles of length divisible by three in GG.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.