The independence-complex conjecture for products of three complete graphs

Let KnK_n denote the complete graph on nn vertices, let ×\times denote the graph product, and let Ind(G){\rm{Ind}}(G) denote the independence complex of a graph GG. For n2n\geq 2, the independence-complex conjecture.

Ind(K2×K3×Kn)(n1)(3n2)S3.{\rm{Ind}}(K_2\times K_3\times K_n)\simeq\bigvee\limits_{(n-1)(3n-2)}\mathbb{S}^3.

This conjecture is based on computer calculations of the Betti numbers for the indicated independence complexes; its resolution would establish the proposed wedge-of-spheres description for this family.

Sources & referencesView supporting material

Primary source

Shuchita Goyal, Samir Shukla and Anurag Singh, “Homotopy Type of Independence Complexes of Certain Families of Graphs”, arXiv:1905.06926 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.