Discrete connectivity conjecture for the graphs
Let be a cycle graph of length , and let be the graphs defined recursively in the source via the discrete suspension construction. Let denote the th discrete homotopy group. Discrete connectivity conjecture for . For every , the group is trivial.
This asserts that has the discrete analogue of -connectedness, which would provide the connectivity hypothesis needed to apply a higher discrete Hurewicz theorem. The source presents this as a suspicion motivating the analogy with the sphere , not as a proved result.
References
- Bob Lutz, “Higher discrete homotopy groups of graphs”, arXiv:2003.02390 (2020).
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.