Maximum flow and self-avoiding walk on bunkbed graphs

Pengfei Tang

We consider two combinatorial models on bunkbed graphs: maximum flow and self-avoiding walks. A bunkbed graph is defined as the Cartesian product $G\times K_2$, where $G$ is a fini…