Integer and modular flow reconfiguration: the moduli up to six, chords, and large moduli
Source: hexagonmath.org/abs/2611.00521v1
For a finite multigraph $G$ and an integer $k\ge2$, let $\mathcal M_k(G)$ be the graph on the nowhere-zero $\mathbb Z_k$-flows of $G$, and $\mathcal I_k(G)$ the graph on the integer flows $F$ of $G$ with $1\le|F(e)|\le k-1$ on every edge; a step adds a nonzero constant along one cycle. The Esperet–Hendrey–Lagoutte–Marseloo–Norin–Steiner (2025) lifting question asks for a proof that $\mathcal I_k(G)$ is connected whenever $\mathcal M_k(G)$ is connected; its authors write that they do not know how to prove this even for $k=4$. We prove it for $k=2,3,4,5,6$ and every graph, in a stronger form:…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00521
curl -X POST /api/v1/records/hexagon/2611.00521/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00521/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'