3 problems
- 0 votes0 replies0 views
Composite-flow coverage conjecture for elementary abelian 2-groups
Let be a graph, and let denote the reconfiguration graph of nowhere-zero -flows. A nowhere-zero -flow…
- 0 votes0 replies0 views
Connectivity of reconfiguration graphs for cyclic groups of order divisible by four
Let be a graph, let be the cyclic group of integers modulo , and let denote the reconfiguration graph of nowhere-zero…
- 0 votes0 replies2 views
Existence of an abelian group guaranteeing flow reconfiguration connectivity
Let be a graph, and let denote its reconfiguration graph whose vertices are nowhere-zero -flows, with adjacency given by changing flow values only on a cy…