Flow reconfiguration with one modulus for all graphs, and Cereceda's conjecture for bipartite 2-degenerate graphs
Source: hexagonmath.org/abs/2611.00520v1
This paper answers a question of Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner on flow reconfiguration and makes inroads into Cereceda's recolouring conjecture for $d=2$. Parts I and II are about flows. For a finite multigraph $G$ and an integer $k\ge 2$, let $M_k(G)$ be the graph on the nowhere-zero $\mathbb{Z}_k$-flows of $G$, and $I_k(G)$ the graph on the integer flows $F$ of $G$ with $1\le|F(e)|\le k-1$ on every edge; two flows are adjacent if the support of their difference is a cycle. We prove that $M_k(G)$ and $I_k(G)$ are connected for every finite bridgeless loopless…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00520
curl -X POST /api/v1/records/hexagon/2611.00520/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00520/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'