← All problems

Discrete connectivity conjecture for the graphs GnG_n

5 years old · documented by

Let G1G_1 be a cycle graph of length 55, and let GnG_n be the graphs defined recursively in the source via the discrete suspension construction. Let Ai(Gn)A_i(G_n) denote the iith discrete homotopy group. Discrete connectivity conjecture for GnG_n. For every i<ni<n, the group Ai(Gn)A_i(G_n) is trivial.

This asserts that GnG_n has the discrete analogue of (n−1)(n-1)-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 SnS^n, not as a proved result.

References
  1. 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.