← All problems

Vanishing conjecture for random graph neighborhood-complex cohomology

25 years old · traced to

Let G(n,p)G(n,p) be the binomial random graph, and let N[G(n,p)]\mathcal{N}[G(n,p)] denote its neighborhood complex. For an integer k≥0k\geq 0, let H~k+1(N[G(n,p)])\widetilde{H}^{k+1}(\mathcal{N}[G(n,p)]) denote its reduced cohomology group.

Cohomology-vanishing conjecture. If

(nk+2)(1−pk+2)n−k−2=o(1),\binom{n}{k+2}(1-p^{k+2})^{n-k-2}=o(1),

then, asymptotically almost surely,

H~k+1(N[G(n,p)])=0.\widetilde{H}^{k+1}(\mathcal{N}[G(n,p)])=0.

This is the proposed extension of the preceding result to the case s=0s=0. It is stated as further research, and the source gives no resolution.

References

19 papers in this index state this conjecture (2001–2025). The statement above is taken from the most recent of them; the others are arXiv:2508.17392, arXiv:2505.03630, arXiv:2410.03871, arXiv:2409.18019, arXiv:2311.13382, arXiv:2211.03901, arXiv:2208.06253, arXiv:2106.15390, arXiv:1908.11359, arXiv:1811.06188, arXiv:1708.07998, arXiv:1605.05380, and 6 more.

Source: Xiongfeng Zhan, Xueyi Huang and Jin-Xin Zhou, “Eigenvalue bounds for combinatorial Laplacians and an application to random complexes”, arXiv:2510.25083 (2025).

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.