← All problems

Feng–Wang homology conjecture for independence complexes of Kneser graphs

For every integer k≥0k\ge 0, let KG⁡(3,k)\operatorname{KG}(3,k) be the graph with vertex set ([k+6]3)\binom{[k+6]}{3}, in which two vertices are adjacent exactly when the corresponding 33-subsets are disjoint. Then the conjecture asserts that H~i ⁣(Ind⁡(KG⁡(3,k));Q)=0\widetilde H_i\!\left(\operatorname{Ind}(\operatorname{KG}(3,k));\mathbb{Q}\right)=0 for every i∉{6,9}i\notin\{6,9\}, and that dim⁡QH~9 ⁣(Ind⁡(KG⁡(3,k));Q)=(k+66)\dim_{\mathbb{Q}}\widetilde H_9\!\left(\operatorname{Ind}(\operatorname{KG}(3,k));\mathbb{Q}\right)=\binom{k+6}{6}, where Ind⁡(G)\operatorname{Ind}(G) denotes the independence complex of GG.

References

Progress summary

Refreshed
Open · solution reported

A preprint dated October 12, 2026 claims to settle the three-element case, but the result has not been independently checked.

Feng and Wang asked whether the reduced homology of the independence complex of the Kneser graph on triples occurs only in dimensions 66 and 99, with a specific rank in dimension 99. Their 2024 work left this as an open question.

Known results

  • Feng and Wang, 2024: computed small cases, constructed generators in dimension 66, proved partial lower bounds and connectivity results, and conjectured the dimension-99 rank (k+66)\binom{k+6}{6}.

October 12, 2026 rational triple-case claim

On October 12, 2026, Ziqin Feng’s preprint The rational homology of independence complexes of Kneser graphs on triples claimed that, for every k≥0k\ge 0, the only nonzero reduced rational Betti numbers of Ind⁡(KG⁡(3,k))\operatorname{Ind}(\operatorname{KG}(3,k)) are β6=(k+57)+29(k+67)\beta_6=\binom{k+5}{7}+29\binom{k+6}{7} and β9=(k+66)\beta_9=\binom{k+6}{6}. This would settle the conjecture in the triple case over the rationals, but the proof is unrefereed and has no independent substantive assessment.

Current status (as of October 2026): The triple case over the rationals is claimed solved by an unrefereed preprint; independent verification is absent, and no broader case is settled here.

Sources

Solutions 0

No solutions have been posted yet.