Vanishing conjecture for random graph neighborhood-complex cohomology
Vanishing conjecture for random graph neighborhood-complex cohomology
Let be the binomial random graph, and let denote its neighborhood complex. For an integer , let denote its reduced cohomology group.
Cohomology-vanishing conjecture. If
then, asymptotically almost surely,
This is the proposed extension of the preceding result to the case . It is stated as further research, and the source gives no resolution.
Sources & referencesView supporting material
Primary source
Xiongfeng Zhan, Xueyi Huang and Jin-Xin Zhou, “Eigenvalue bounds for combinatorial Laplacians and an application to random complexes”, arXiv:2510.25083 (2025).
Additional 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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.