Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the topological Kalai-Meshulam conjecture

Published 23 Sep 2020 in math.CO, math.AT, and math.GT | (2009.11077v1)

Abstract: Chudnovsky, Scott, Seymour and Spirkl recently proved a conjecture by Kalai and Meshulam stating that the reduced Euler characteristic of the independence complex of a graph without induced cycles of length divisible by three is in {-1,0,1}. Gauthier had earlier proved that assuming no cycles of those lengths, induced or not. Kalai and Meshulam also stated a stronger topological conjecture, that the total betti numbers are in {0,1}. Towards that we prove an even stronger statement in the same setting as Gauthier: The independence complexes are either contractible or homotopy equivalent to spheres. We conjecture that it also holds in the general setting.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.